Best play in dots and boxes endgames

DOI10.1007/S00182-020-00730-4zbMATH Open1478.91041arXiv1811.10747OpenAlexW3126451830MaRDI QIDQ2230544FDOQ2230544

Authors: Daniel Allcock 

Publication date: 24 September 2021

Published in: International Journal of Game Theory (Search for Journal in Brave)

Abstract: We give very simple algorithms for best play in the simplest kind of Dots & 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 number of boxes they capture, and specify a move that leads to that result. We improve on results of 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.

Full work available at URL: https://arxiv.org/abs/1811.10747

Recommendations

• Playing simple loony dots-and-boxes endgames optimally
• scientific article; zbMATH DE number 3939129
• Publication:4501763
• Variations on Narrow Dots-and-Boxes and Dots-and-Triangles
• Narrow misère dots-and-boxes

zbMATH Keywords

control strategycombinatorial game theorydots and boxesnimstring

Mathematics Subject Classification ID

Combinatorial games (91A46)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Playing simple loony dots-and-boxes endgames optimally

Cited In (3)

• Playing simple loony dots-and-boxes endgames optimally
• Narrow misère dots-and-boxes
• How to play MetaSquares

This page was built for publication: Best play in dots and boxes endgames

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230544)