CAP4630 Introduction to Artificial Intelligence Homework 4 (7 pts, Due Oct 3 2018) Homework solutions must be submitted through Canvas. No email submission is accepted. Please include all your answers in one file (pdf or word file). If you have multiple pictures, please include all pictures in one Word/pdf file. If you have.to submit multiple files, please include all files as one zip file, and submit zip file online. You can always update your submissions before due date, but only the latest version will be grade [2 pts]. Figure 1 lists the initial state and the goal state of Eight Puzzle game (with eight letter-tiles and one empty tile, i.e., the white tile). Please use Best-First Search to build a search tree to carry out search from the initial state to the goal state 1. a. Please use number of misplaced letter-titles as the heuristic function, and report the search tree from the initial node to the goal node (please also include the evaluation function values F(N) and heuristic function values h(N) for each note) Please use Manhattan distance between each letter-tile and its goal position as the heuristic function, and report the search tree from the initial node to the goal node (please also include the evaluation function values F(N) and heuristic function values h(N) for each note). b. BE C ABC G F A D H G H (a) Initial State (b) Goal State Figure 1: Eight Puzzle Game CAP4630 Introduction to Artificial Intelligence Homework 4 (7 pts, Due Oct 3 2018) Homework solutions must be submitted through Canvas. No email submission is accepted. Please include all your answers in one file (pdf or word file). If you have multiple pictures, please include all pictures in one Word/pdf file. If you have.to submit multiple files, please include all files as one zip file, and submit zip file online. You can always update your submissions before due date, but only the latest version will be grade [2 pts]. Figure 1 lists the initial state and the goal state of Eight Puzzle game (with eight letter-tiles and one empty tile, i.e., the white tile). Please use Best-First Search to build a search tree to carry out search from the initial state to the goal state 1. a. Please use number of misplaced letter-titles as the heuristic function, and report the search tree from the initial node to the goal node (please also include the evaluation function values F(N) and heuristic function values h(N) for each note) Please use Manhattan distance between each letter-tile and its goal position as the heuristic function, and report the search tree from the initial node to the goal node (please also include the evaluation function values F(N) and heuristic function values h(N) for each note). b. BE C ABC G F A D H G H (a) Initial State (b) Goal State Figure 1: Eight Puzzle Game
