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.

A183193 Minimum number of counters left after a winning opening move for Dakon-n.

Original entry on oeis.org

2, 4, 2, 2, 3, 3, 4
Offset: 4

Views

Author

George Pollard, Dec 15 2011

Keywords

Comments

Dakon-n is the game of Dakon played with n small holes per player. This sequence records the minimum number of counters left for a particular n, after the starting player wins on their first turn.

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.