Artificial Intelligence

Nzvinx
timer Asked: Feb 19th, 2018

Question Description

I want the program to be written in java format and also i need the comments line to line and also i need the screenshots of the output generated.

Unformatted Attachment Preview

This homework is for graduate students ______________________________________________________________________________ CS460G: AI Methods HOMEWORK 2 Department of Computer Science 6 points Western Illinois University Professor: Byoung Jik Lee Due: 02/20/2016 ______________________________________________________________________________ (1). (3 points) Consider the following search problem. The starting node is S. The goal state is G. B C 5 6 2 3 13 S G 10 2 7 6 3 D E 4 The heuristic h value, h1(n), for each state is given as follows; state heuristic h value S 11 B 5 C 2 D 9 E 4 G 0 (1-1). Apply Greedy-Best Search which we discussed in class.      Write the state which you select to expand and write why you choose it. We include the repeated states. Write the order of selected expanding states when you apply this search. You need to show the process of each action step by step. o You need to construct the search tree for each selection What is your final solution (the sequence of states to reach the goal)? (1-2) Apply A* algorithm to find the solution.      Write the state which you select to expand and write why you choose it. We include the repeated states. Write the order of selected expanding states when you apply this search as shown below; suppose C was selected among candidates after the starting state S. You need to show the process of each action step by step as below. o You need to construct the search tree for each selection What is your final solution (the sequence of states to reach the goal)? 1 S 1 S 1 f(S) value 2 B C f(B) f(C) … …. (2). (3 points) Program the above problem for A* algorithm. You can use any programming language and any data structures. You need to display the steps of running your program, i.e., you need to print the running process of your program. When you select one node out of nodes pool by A* algorithm, you need to print why you choose that node by printing the values of function f(n) with h(n) and g(n). (2-1) Program the above problem for A* algorithm using the given h1(n) (2-2) We have a new heuristic h value, h2(n), for each state is given as follows; Change the heuristic value of B as 7 and run your program as follows The heuristic h value, h2(n), for each state is given as follows; state heuristic h value S 11 B 7 C 2 D 9 E 4 G 0 (2-3) Which heuristic function is better and why? Submit your printed source code and output result in class. Submit your source code and output to WesternOnline. 2
User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

This question has not been answered.

Create a free account to get help with this and any other question!

Related Tags

Brown University





1271 Tutors

California Institute of Technology




2131 Tutors

Carnegie Mellon University




982 Tutors

Columbia University





1256 Tutors

Dartmouth University





2113 Tutors

Emory University





2279 Tutors

Harvard University





599 Tutors

Massachusetts Institute of Technology



2319 Tutors

New York University





1645 Tutors

Notre Dam University





1911 Tutors

Oklahoma University





2122 Tutors

Pennsylvania State University





932 Tutors

Princeton University





1211 Tutors

Stanford University





983 Tutors

University of California





1282 Tutors

Oxford University





123 Tutors

Yale University





2325 Tutors