IEEE transactions on computational intelligence and AI in games., 2011-03, Vol.3 (1), p.57-66
2011
Details
- Autor(en) / Beteiligte
- Titel
- Best Reply Search for Multiplayer Games
- Ist Teil von
- IEEE transactions on computational intelligence and AI in games., 2011-03, Vol.3 (1), p.57-66
- Ort / Verlag
- Piscataway: IEEE
- Erscheinungsjahr
- 2011
- Link zum Volltext
- Quelle
- IEEE Electronic Library (IEL)
- Beschreibungen/Notizen
- 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™. In all games, BRS is superior to the max n 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.
- Sprache
- Englisch
- Identifikatoren
- ISSN: 1943-068XeISSN: 1943-0698DOI: 10.1109/TCIAIG.2011.2107323Titel-ID: cdi_proquest_miscellaneous_869805256
- Format
- –
- Schlagworte
- Algorithms, Artificial intelligence, best reply search (BRS), Checkers, Chinese Checkers, Engines, Focus, Games, Heart, Intelligence, Law, Max ^n, Multiplayer games, paranoid, Planning, Radiation detectors, Rolit, Roots, Search methods, Searching