Skip to main content
SpringerLink
Log in

A Theory of Heuristic Information in Game-Tree Search

  • Book
  • © 1988

Overview

Authors:
  1. Chun-Hung Tzeng

    1. Department of Computer Science, College of Sciences and Humanities, Ball State University, Muncie, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Symbolic Computation (SYMBOLIC)

Part of the book sub series: Artificial Intelligence (1064)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (11 chapters)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Introduction

    • Chun-Hung Tzeng
    Pages 1-6

  3. Games and Minimax Values

    • Chun-Hung Tzeng
    Pages 7-17

  4. Heuristic Game-Tree Searches

    • Chun-Hung Tzeng
    Pages 18-27

  5. Probability Spaces and Martingales

    • Chun-Hung Tzeng
    Pages 28-39

  6. Probabilistic Game Models and Game Values

    • Chun-Hung Tzeng
    Pages 40-50

  7. Heuristic Information

    • Chun-Hung Tzeng
    Pages 51-63

  8. Estimation and Decision Making

    • Chun-Hung Tzeng
    Pages 64-72

  9. Independence and Product-Propagation Rules

    • Chun-Hung Tzeng
    Pages 73-80

  10. Estimation of Minimax Values in P b -Game Models

    • Chun-Hung Tzeng
    Pages 81-86

  11. Estimation of Minimax Values in G d -Game Models

    • Chun-Hung Tzeng
    Pages 87-97

  12. Conclusions

    • Chun-Hung Tzeng
    Pages 98-99

  13. Back Matter

    Pages 100-107
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Department of Computer Science, College of Sciences and Humanities, Ball State University, Muncie, USA

    Chun-Hung Tzeng

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation