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

Quang Vu; Taichi Ishitobi; Jean-Christophe Terrillon; Hiroyuki Iida

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

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

Topics: State Space Search

In Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, 400-406, 2016 , Rome, Italy

Authors: Quang Vu ; Taichi Ishitobi ; Jean-Christophe Terrillon and Hiroyuki Iida

Affiliation: JAIST, Japan

Keyword(s): Conspiracy Number, Evaluation Function, Move Selection, Minimax Search.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; State Space Search ; Symbolic Systems

Abstract: 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 evaluation value is suggested. Empirical results obtained for the game of Othello show the potential of the proposed method.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

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

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:

Vu, Q.; Ishitobi, T.; Terrillon, J. and Iida, H. (2016). Using Conspiracy Numbers for Improving Move Selection in Minimax Game-Tree Search. In Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART; ISBN 978-989-758-172-4; ISSN 2184-433X, SciTePress, pages 400-406. DOI: 10.5220/0005753004000406

@conference{icaart16,
author={Quang Vu. and Taichi Ishitobi. and Jean{-}Christophe Terrillon. and Hiroyuki Iida.},
title={Using Conspiracy Numbers for Improving Move Selection in Minimax Game-Tree Search},
booktitle={Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART},
year={2016},
pages={400-406},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005753004000406},
isbn={978-989-758-172-4},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART
TI - Using Conspiracy Numbers for Improving Move Selection in Minimax Game-Tree Search
SN - 978-989-758-172-4
IS - 2184-433X
AU - Vu, Q.
AU - Ishitobi, T.
AU - Terrillon, J.
AU - Iida, H.
PY - 2016
SP - 400
EP - 406
DO - 10.5220/0005753004000406
PB - SciTePress