login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A183192 Length of shortest winning opening sequences for Dakon-n 0
12, 24, 19, 25, 29 (list; graph; refs; listen; history; text; internal format)
OFFSET
4,1
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.
LINKS
CROSSREFS
Sequence in context: A059161 A133491 A075606 * A117320 A040132 A296749
KEYWORD
nonn
AUTHOR
George Pollard, Dec 15 2011
EXTENSIONS
Corrected the offset.
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 1 09:39 EDT 2024. Contains 372163 sequences. (Running on oeis4.)