![]() Uninformed search Searching for the goal without knowing in which direction it is. ![]() Goal test: Check whether the goal state has been reached.Successor function (actions): Blank moves Left, Right, Up, or Down.State: Specification of each of the eight tiles in the nine squares (the blank is in the remaining square).One way to solve this is to search for a path q(0) q(1) q(2) . Cooperating Intelligent Systems Uninformed search Chapter 3, AIMA (freely available in the internet with the name AMIA_Ch3_L2.ppt, Sweden) Complement to the 8-puzzle and missionaries and cannibals problemsĪn initial state, q(0) A list of possible actions, a, for the agent A goal test (there can be many goal states) A path cost
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |