cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A183192 Length of shortest winning opening sequences for Dakon-n.

Original entry on oeis.org

12, 24, 19, 25, 29
Offset: 4

Views

Author

George Pollard, Dec 15 2011

Keywords

Comments

Dakon-n is the game of Dakon, with n small holes per player. This sequence records the minimum number of moves in a play which wins outright on the starting player's first turn. The best-known values for 9 and 10 holes are 41 and 68, respectively.

References

  • J. Donkers, A. de Voogt and J. Uiterwijk, Human versus Machine Problem-Solving: Winning Openings in Dakon, Board Game Studies 3 (2000), 79-88.

Extensions

Corrected the offset.