Characterizing the Nature of Probability-Based Proof Number Search: A Case Study in the Othello and Connect Four Games

• Main Authors: Anggina Primanita, Mohd Nor Akmal Khalid, and Hiroyuki Iida
• Format: Article
• Language: English
• Published: MDPI AG 2020-05-01
• Series: Information
• Subjects: best-first search; probability-based proof number search; Connect Four; Othello
• Online Access: https://www.mdpi.com/2078-2489/11/5/264

Variants of best-first search algorithms and their expansions have continuously been introduced to solve challenging problems. The probability-based proof number search (PPNS) is a best-first search algorithm that can be used to solve positions in AND/OR game tree structures. It combines information from explored (based on winning status) and unexplored (through Monte Carlo simulation) nodes from a game tree using an indicator called the probability-based proof number (PPN). In this study, PPNS is employed to solve randomly generated positions in Connect Four and Othello, in which the results are compared with the two well-known best-first search algorithms (proof number search (PNS) and Monte Carlo proof number search). Adopting a simple improvement parameter in PPNS reduces the number of nodes that need to be explored by up to 57%. Moreover, further observation showed the varying importance of information from explored and unexplored nodes in which PPNS relies critically on the combination of such information in earlier stages of the Othello game. Discussion and insights from these findings are provided where the potential future works are briefly described.