login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A183193 Minimum number of counters left after a winning opening move for Dakon-n. 0
2, 4, 2, 2, 3, 3, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,1

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.

LINKS

Table of n, a(n) for n=4..10.

CROSSREFS

Sequence in context: A013604 A218217 A218279 * A021809 A210210 A117007

Adjacent sequences:  A183190 A183191 A183192 * A183194 A183195 A183196

KEYWORD

nonn

AUTHOR

George Pollard, Dec 15 2011

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified September 20 15:44 EDT 2017. Contains 292275 sequences.