A Theory of Heuristic Information in Game-Tree Search (Artificial Intelligence) - Softcover

Tzeng, Chun-Hung

Softcover

ISBN 10: 3642648126 ISBN 13: 9783642648120

Verlag: Springer, 2013

Über diesen Titel

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.

Reseña del editor

This book presents the use of imperfect information (called heuristic information) in game-tree search. Its purpose is to investigate the theoretical background of the use of heuristic information in game-tree search. Computer programs playing games usually search the game-tree to a reasonable depth with a static evaluation function and make decisions based upon backed-up values. Since the information in either the backed-up values or the values returned directly by the static evaluation function is often imperfect, decision making is usually not optimal. Also, pathological cases show why intuition about game-tree search is not always correct. This book introduces a mathematical formulation of heuristic information and a theoretical model of game-tree search. In this model, notions of game-tree search are formulated in mathematical terms and a sound mathematical theory of heuristic information is developed. The conventional pathological cases disappear in this theory. This book is accessible to the general AI community, for example first year graduate students who have completed an introductory AI course and have at least some background in probability. The book is also a foundation for further work on game-tree search as well as on heuristic information in general AI.

Details zur Ausgabe

• Verlag: Springer
• Erscheinungsdatum: 2013
• ISBN 10: 3642648126
• ISBN 13: 9783642648120
• Einband: Tapa blanda
• Sprache: Englisch
• Anzahl der Seiten: 120