Win, Lose, or Get Out the Way - Eliminating Unnecessary Evaluation in Game Search

Hsiu-Chin Lin; Colleen van Lent

Win, Lose, or Get Out the Way - Eliminating Unnecessary Evaluation in Game Search

Hsiu-Chin Lin, Colleen van Lent

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper we present our approach of improving the traditional alpha-beta search process for strategic board games by modifying the method in two ways: 1) forgoing the evaluation of leaf nodes that are not terminal states and 2) employing a utility table that stores the utility for subsets of board configurations. In this paper we concentrate our efforts on the game of Connect Four. Our results have shown significant speed-up, as well as a framework that relaxes common agent assumptions in game search. In addition, it allows game designers to easily modify the agent's strategy by changing the goal from dominance to interaction.

Original language	English
Title of host publication	Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, May 15-17, 2008, Coconut Grove, Florida, USA
Publisher	The AAAI Press
Pages	392-393
Number of pages	2
Publication status	Published - 2008

Access to Document

http://www.aaai.org/Library/FLAIRS/2008/flairs08-093.php

Cite this

@inproceedings{fa163f7505a6489789a4bcfcf117ce9a,

title = "Win, Lose, or Get Out the Way - Eliminating Unnecessary Evaluation in Game Search",

abstract = "In this paper we present our approach of improving the traditional alpha-beta search process for strategic board games by modifying the method in two ways: 1) forgoing the evaluation of leaf nodes that are not terminal states and 2) employing a utility table that stores the utility for subsets of board configurations. In this paper we concentrate our efforts on the game of Connect Four. Our results have shown significant speed-up, as well as a framework that relaxes common agent assumptions in game search. In addition, it allows game designers to easily modify the agent's strategy by changing the goal from dominance to interaction.",

author = "Hsiu-Chin Lin and Lent, {Colleen van}",

year = "2008",

language = "English",

pages = "392--393",

booktitle = "Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, May 15-17, 2008, Coconut Grove, Florida, USA",

publisher = "The AAAI Press",

}

Win, Lose, or Get Out the Way - Eliminating Unnecessary Evaluation in Game Search. / Lin, Hsiu-Chin; Lent, Colleen van.
Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, May 15-17, 2008, Coconut Grove, Florida, USA. The AAAI Press, 2008. p. 392-393.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Win, Lose, or Get Out the Way - Eliminating Unnecessary Evaluation in Game Search

AU - Lin, Hsiu-Chin

AU - Lent, Colleen van

PY - 2008

Y1 - 2008

N2 - In this paper we present our approach of improving the traditional alpha-beta search process for strategic board games by modifying the method in two ways: 1) forgoing the evaluation of leaf nodes that are not terminal states and 2) employing a utility table that stores the utility for subsets of board configurations. In this paper we concentrate our efforts on the game of Connect Four. Our results have shown significant speed-up, as well as a framework that relaxes common agent assumptions in game search. In addition, it allows game designers to easily modify the agent's strategy by changing the goal from dominance to interaction.

AB - In this paper we present our approach of improving the traditional alpha-beta search process for strategic board games by modifying the method in two ways: 1) forgoing the evaluation of leaf nodes that are not terminal states and 2) employing a utility table that stores the utility for subsets of board configurations. In this paper we concentrate our efforts on the game of Connect Four. Our results have shown significant speed-up, as well as a framework that relaxes common agent assumptions in game search. In addition, it allows game designers to easily modify the agent's strategy by changing the goal from dominance to interaction.

M3 - Conference contribution

SP - 392

EP - 393

BT - Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, May 15-17, 2008, Coconut Grove, Florida, USA

PB - The AAAI Press

ER -

Win, Lose, or Get Out the Way - Eliminating Unnecessary Evaluation in Game Search

Abstract

Access to Document

Fingerprint

Cite this