Authors: Sarot Busala 1 ; Zhang Song 1 ; Hiroyuki Iida 1 ; Mohd Khalid 1 and Umi Yusof 2

Affiliations: 1 Japan Advanced Institute of Science and Technology, 923-1211 Ishikawa Prefecture, Nomi, Asahidai and Japan ; 2 School of Computer Sciences, University of Science Malaysia, 11800 Georgetown, Pulau Pinang and Malaysia

ISBN: 978-989-758-350-6

ISSN: 2184-433X

Keyword(s): Checkers, MIN-MAX Search Tree, Conspiracy Number, Single Conspiracy Number.

Related Ontology Subjects/Areas/Topics: AI and Creativity ; Artificial Intelligence ; Artificial Intelligence and Decision Support Systems ; Computational Intelligence ; Enterprise Information Systems ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Soft Computing ; State Space Search ; Symbolic Systems

Abstract: Game playing provides the medium for a variety of algorithms to formulate play decisions that surpass human expert. However, the reasons that distinguish the winning and losing positions remain actively researched which leads to the utilization of the search “indicator”. Conspiracy number search (CNS) and proof number search (PNS) had been popularly adopted as the search indicators in MIN/MAX and AND/OR tree, respectively. However, their limitations had encouraged the need for an alternative search indicator. The single conspiracy number (SCN) is a search indicator inspired by CNS and PNS which measure the difficulty of getting MIN/MAX value over a threshold point for a current root node. Recently, SCN had been successfully applied in Chinese chess to analyze both the progress pattern and long-term position. In this paper, analysis of the SCN within the game of checkers is conducted where different SCN threshold values and varying depth of the search tree were considered. Checkers was chosen due to its smaller search space and contain a rule that affects the shape of the search tree. The experimental results show that the SCN values stabilize as the depth of the search tree increases whether the player is in winning, drawing or losing position. (More)

PDF ImageFull Text


Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Busala, S.; Song, Z.; Iida, H.; Khalid, M. and Yusof, U. (2019). Single Conspiracy Number Analysis in Checkers.In Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-350-6, ISSN 2184-433X, pages 539-546. DOI: 10.5220/0007344005390546

author={Sarot Busala. and Zhang Song. and Hiroyuki Iida. and Mohd Nor Akmal Khalid. and Umi Kalsom Yusof.},
title={Single Conspiracy Number Analysis in Checkers},
booktitle={Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},


JO - Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Single Conspiracy Number Analysis in Checkers
SN - 978-989-758-350-6
AU - Busala, S.
AU - Song, Z.
AU - Iida, H.
AU - Khalid, M.
AU - Yusof, U.
PY - 2019
SP - 539
EP - 546
DO - 10.5220/0007344005390546

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.