Best play in Dots and Boxes endgames

Daniel Allcock ()
Additional contact information
Daniel Allcock: University of Texas

International Journal of Game Theory, 2021, vol. 50, issue 3, No 6, 693 pages

Abstract: Abstract We give very simple algorithms for best play in the simplest kind of Dots and Boxes endgames: those that consist entirely of loops and long chains. In every such endgame we compute the margin of victory, assuming both players maximize the numbers of boxes they capture, and specify a move that leads to that result. We improve on results by Buzzard and Ciere on the same problem: our algorithms examine only the current position and do not need to consider the game tree at all.

Keywords: Dots and Boxes; Nimstring; Control strategy; 91A46 (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s00182-020-00730-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jogath:v:50:y:2021:i:3:d:10.1007_s00182-020-00730-4

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/182/PS2

DOI: 10.1007/s00182-020-00730-4

Access Statistics for this article

International Journal of Game Theory is currently edited by Shmuel Zamir, Vijay Krishna and Bernhard von Stengel

More articles in International Journal of Game Theory from Springer, Game Theory Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().