Playing simple loony dots-and-boxes endgames optimally
From MaRDI portal
Abstract: We explain a highly efficient algorithm for playing the simplest type of dots and boxes endgame optimally (by which we mean "in such a way so as to maximise the number of boxes that you take"). The algorithm is sufficiently simple that it can be learnt and used in over-the-board games by humans. The types of endgames we solve come up commonly in practice in well-played games on a 5x5 board and were in fact developed by the authors in order to improve their over-the-board play.
Recommendations
Cited in
(9)- The vertex picking game and a variation of the game of dots and boxes
- Best play in dots and boxes endgames
- Dawson's chess revisited
- Narrow misère dots-and-boxes
- Algorithms for interactive Sprouts
- scientific article; zbMATH DE number 988823 (Why is no real title available?)
- scientific article; zbMATH DE number 3939129 (Why is no real title available?)
- scientific article; zbMATH DE number 7069621 (Why is no real title available?)
- Dots & Polygons (Media Exposition)
This page was built for publication: Playing simple loony dots-and-boxes endgames optimally
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5246196)