A Theory of Heuristic Information in Game-Tree Search von Tzeng Chun-Hung: New (2011)

Beschreibung

Print on Demand pp. 120 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam.

Bestandsnummer des Verk�ufers 135037831

Verk�ufer kontaktieren

Diesen Artikel melden

Bibliografische Details

Titel: A Theory of Heuristic Information in Game-Tree Search
Verlag: Springer
Ver�ffentlichungsdatum: 2011
Sprache: Englisch
ISBN-10: 3642648126
ISBN-13: 9783642648120
Bindung: Softcover
Zustand: New

�ber diesen Titel

Inhaltsangabe

Searching is an important process in most AI systems, especially in those AI production systems consisting of a global database, a set of production rules, and a control system. Because of the intractability of uninformed search procedures, the use of heuristic information is necessary in most searching processes of AI systems. This important concept of heuristic informatioD is the central topic of this book. We first use the 8-puzzle and the game tic-tac-toe (noughts and crosses) as examples to help our discussion. The 8-puzzle consists of eight numbered movable tiles set in a 3 x 3 frame. One cell of the frame is empty so that it is possible to move an adjacent numbered tile into the empty cell. Given two tile configurations, initial and goal, an 8-puzzle problem consists of changing the initial configuration into the goal configuration, as illustrated in Fig. 1.1. A solution to this problem is a sequence of moves leading from the initial configuration to the goal configuration, and an optimal solution is a solution having the smallest number of moves. Not all problems have solutions; for example, in Fig. 1.1, Problem 1 has many solutions while Problem 2 has no solution at all.

Rese�a del editor

Searching is an important process in most AI systems, especially in those AI production systems consisting of a global database, a set of production rules, and a control system. Because of the intractability of uninformed search procedures, the use of heuristic information is necessary in most searching processes of AI systems. This important concept of heuristic informatioD is the central topic of this book. We first use the 8-puzzle and the game tic-tac-toe (noughts and crosses) as examples to help our discussion. The 8-puzzle consists of eight numbered movable tiles set in a 3 x 3 frame. One cell of the frame is empty so that it is possible to move an adjacent numbered tile into the empty cell. Given two tile configurations, initial and goal, an 8-puzzle problem consists of changing the initial configuration into the goal configuration, as illustrated in Fig. 1.1. A solution to this problem is a sequence of moves leading from the initial configuration to the goal configuration, and an optimal solution is a solution having the smallest number of moves. Not all problems have solutions; for example, in Fig. 1.1, Problem 1 has many solutions while Problem 2 has no solution at all.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.