Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Mar 30 2012 18:59:37
%S 12,24,19,25,29
%N Length of shortest winning opening sequences for Dakon-n
%C 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.
%D J. Donkers, A. de Voogt and J. Uiterwijk, Human versus Machine Problem-Solving: Winning Openings in Dakon, Board Game Studies 3 (2000), 79-88.
%K nonn
%O 4,1
%A _George Pollard_, Dec 15 2011
%E Corrected the offset.