DeepAI AI Chat
Log In Sign Up

On AO*, Proof Number Search and Minimax Search

by   Chao Gao, et al.

We discuss the interconnections between AO*, adversarial game-searching algorithms, e.g., proof number search and minimax search. The former was developed in the context of a general AND/OR graph model, while the latter were mostly presented in game-trees which are sometimes modeled using AND/OR trees. It is thus worth investigating to what extent these algorithms are related and how they are connected. In this paper, we explicate the interconnections between these search paradigms. We argue that generalized proof number search might be regarded as a more informed replacement of AO* for solving arbitrary AND/OR graphs, and the minimax principle might also extended to use dual heuristics.


page 1

page 2

page 3

page 4


Towards solving the 7-in-a-row game

Our paper explores the game theoretic value of the 7-in-a-row game. We r...

Nearly Optimal Minimax Tree Search?

Knuth and Moore presented a theoretical lower bound on the number of lea...

On Computation Complexity of True Proof Number Search

We point out that the computation of true proof and disproof numbers for...

On the Diameter of Tree Associahedra

We consider a natural notion of search trees on graphs, which we show is...

Best-First and Depth-First Minimax Search in Practice

Most practitioners use a variant of the Alpha-Beta algorithm, a simple d...

Searching by Heterogeneous Agents

In this work we introduce and study a pursuit-evasion game in which the ...

The mixed search game against an agile and visible fugitive is monotone

We consider the mixed search game against an agile and visible fugitive....