Best Reply Search for Multiplayer Games

Maarten P. D. Schadd; Mark H. M. Winands

doi:10.1109/TCIAIG.2011.2107323

Best Reply Search for Multiplayer Games

Maarten P. D. Schadd^*, Mark H. M. Winands

^*Corresponding author for this work

Networks and Strategic Optimization

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

This paper proposes a new algorithm, called best reply search (BRS), for deterministic multiplayer games with perfect information. In BRS, only the opponent with the strongest counter move is allowed to make a move. More turns of the root player can be searched resulting in long-term planning. We test BRS in the games of Chinese Checkers, Focus, and Rolit T. In all games, BRS is superior to the algorithm. We show that BRS also outperforms paranoid in Chinese Checkers and Focus. In Rolit, BRS is on equal footing with paranoid. We conclude that BRS is a promising search method for deterministic multiplayer games with perfect information.

Original language	English
Pages (from-to)	57-66
Journal	IEEE Transactions on Computational Intelligence and AI in Games
Volume	3
Issue number	1
DOIs	https://doi.org/10.1109/TCIAIG.2011.2107323
Publication status	Published - Mar 2011

Keywords

Multiplayer games
best reply search (BRS)
Max(n)
paranoid
Chinese Checkers
Focus
Rolit

Access to Document

10.1109/TCIAIG.2011.2107323

Cite this

@article{0da4832417b74c288745527985e279b5,

title = "Best Reply Search for Multiplayer Games",

abstract = "This paper proposes a new algorithm, called best reply search (BRS), for deterministic multiplayer games with perfect information. In BRS, only the opponent with the strongest counter move is allowed to make a move. More turns of the root player can be searched resulting in long-term planning. We test BRS in the games of Chinese Checkers, Focus, and Rolit T. In all games, BRS is superior to the algorithm. We show that BRS also outperforms paranoid in Chinese Checkers and Focus. In Rolit, BRS is on equal footing with paranoid. We conclude that BRS is a promising search method for deterministic multiplayer games with perfect information.",

keywords = "Multiplayer games, best reply search (BRS), Max(n), paranoid, Chinese Checkers, Focus, Rolit",

author = "Schadd, {Maarten P. D.} and Winands, {Mark H. M.}",

year = "2011",

month = mar,

doi = "10.1109/TCIAIG.2011.2107323",

language = "English",

volume = "3",

pages = "57--66",

journal = "IEEE Transactions on Computational Intelligence and AI in Games",

issn = "1943-068X",

publisher = "IEEE",

number = "1",

}

TY - JOUR

T1 - Best Reply Search for Multiplayer Games

AU - Schadd, Maarten P. D.

AU - Winands, Mark H. M.

PY - 2011/3

Y1 - 2011/3

N2 - This paper proposes a new algorithm, called best reply search (BRS), for deterministic multiplayer games with perfect information. In BRS, only the opponent with the strongest counter move is allowed to make a move. More turns of the root player can be searched resulting in long-term planning. We test BRS in the games of Chinese Checkers, Focus, and Rolit T. In all games, BRS is superior to the algorithm. We show that BRS also outperforms paranoid in Chinese Checkers and Focus. In Rolit, BRS is on equal footing with paranoid. We conclude that BRS is a promising search method for deterministic multiplayer games with perfect information.

AB - This paper proposes a new algorithm, called best reply search (BRS), for deterministic multiplayer games with perfect information. In BRS, only the opponent with the strongest counter move is allowed to make a move. More turns of the root player can be searched resulting in long-term planning. We test BRS in the games of Chinese Checkers, Focus, and Rolit T. In all games, BRS is superior to the algorithm. We show that BRS also outperforms paranoid in Chinese Checkers and Focus. In Rolit, BRS is on equal footing with paranoid. We conclude that BRS is a promising search method for deterministic multiplayer games with perfect information.

KW - Multiplayer games

KW - best reply search (BRS)

KW - Max(n)

KW - paranoid

KW - Chinese Checkers

KW - Focus

KW - Rolit

U2 - 10.1109/TCIAIG.2011.2107323

DO - 10.1109/TCIAIG.2011.2107323

M3 - Article

SN - 1943-068X

VL - 3

SP - 57

EP - 66

JO - IEEE Transactions on Computational Intelligence and AI in Games

JF - IEEE Transactions on Computational Intelligence and AI in Games

IS - 1

ER -