Using Conspiracy Numbers for Improving Move Selection in Minimax Game-Tree Search

  title={Using Conspiracy Numbers for Improving Move Selection in Minimax Game-Tree Search},
  author={Quang-Anh Nguyen Vu and Taichi Ishitobi and Jean-Christophe Terrillon and Hiroyuki Iida},
In a two-person perfect-information game, Conspiracy Number Search (CNS) was invented as a possible search algorithm but did not find much success. However, we believe that the conspiracy number, which is the core of CNS, has not been used to its full potential. In this paper, we propose a novel way to utilize the conspiracy number in the minimax framework. Instead of using conspiracy numbers separately, we combine them together. An example way of combining conspiracy numbers with the… 

Figures and Tables from this paper

Using single Conspiracy Number to analyze game progress patterns
  • Zhang Song, H. Iida
  • Computer Science
    2017 International Conference on Computer, Information and Telecommunication Systems (CITS)
  • 2017
Experimental results show that single conspiracy number can cover the shortage of conventional heuristic values and give more information on the game progress.
Deep Proof-Number Search and Aesthetics of Mating Problems
A new search algorithm based on proof numbers, named DeepPN, has three search indicators (pn, dn, deep) and a single parameter, R, that allows a choice between depth-first and best-first behavior and the relationship between the search indicators and the evaluation of the mating problems in shogi is shown.
Computing Games: Bridging the Gap Between Search and Entertainment
The probability-based proof number search (PPNS) and single conspiracy number (SCN) were used as the domain-independent indicators to analyze how uncertainty affects various game elements and demonstrate the link between the search indicators and the measure of entertainment where uncertainty plays a vital role in both contexts.
Improvisation of Minimax Algorithm with Multi Criteria Decision Maker (MCDM) in the Intelligent Agent of Card Battle Game
Improvisation of Minimax Algorithm with Multi Criteria Decision Maker (MCDM) provides a new way of thinking for the decision making during the game.
Using single conspiracy number for long term position evaluation


Conspiracy Numbers for Min-Max Search
Conspiracy number search with relative sibling scores
Alpha-Beta-Conspiracy Search
A variant of-search in which each node is associated with two depths rather than one, called ABC search is introduced, which can be formally derived from conspiracy theory and the structure of the ABC procedure is justiied by two theorems relating ABC search and conspiracy numbers.
Empirical results with conspiracy numbers
Experiments suggest that more emphasis on breadth, rather than depth, can lead to significant performance improvements in the conspiracy numbers algorithm, using both random and application‐generated trees.
Proof-Number Search
A Minimax Algorithm Better than Alpha-Beta?
Game-Tree Search Using Proof Numbers: The First Twenty Years
An overview of the research on Proof-Number Search and its many variants and enhancements is provided.
Conspiracy Numbers and Caching for Searching And/Or Trees and Theorem-Proving
Experimental results indicate that conspiracy numbers and especially the new caching scheme are effective in practice and should be considered for future research.
Critical Position Identification in Games and Its Application to Speculative Play
The Conspiracy Number Search algorithm is considered where the maximum and minimum conspiracy numbers are recorded in the test bed of a simple Tic-Tac-Toe game application and analyzed as measures of critical position identifier which determines the right moment for possibility of applying speculative play.