Identifying critical positions based on conspiracy numbers

Abstract

Research in two-player perfect information games has been one of the focuses of computer-game related studies in the domain of artificial intelligence. However, focus on an effective search program is insufficient to give the “taste” of actual entertainment in the gaming industry. Instead of focusing on effective search algorithm, we dedicate our study in realizing the possibility of applying strategy changing technique. However, quantifying and determining this possibility is the main challenge imposed in this study. For this purpose, the Conspiracy Number Search algorithm is considered where the maximum and minimum conspiracy numbers are recorded in the test bed of simple Tic-Tac-Toe and Othello game application. We analysed these numbers as the measures of critical position identifier which determines the right moment for possibility of applying strategy changing technique. For Tic-Tac-Toe game, the conspiracy numbers are analysed through operators formally defined in this article as ↑ tactic and ↓ tactic while variance of the conspiracy numbers are analysed in Othello game. Interesting results are obtained with convincing evidences but future works are still needed in order to further strengthen our hypothesis.