Some information about task IOIWARI Various parameters of the game (the number of the pits, the number and distribution of the beads, and especially the rule for moves) have been tuned to satisfy the following requirements: - the game is always winnable by the first player but not easy to win in most cases - some game instances are winnable by the first player playing by a simple (greedy) strategy - efficient solution possible with reasonable resource limitations (memory and CPU time) - draw is possible - the nummber of different game instances is sufficiently large for testing. TEST The opponent program plays to achive maximum score differece for the second player. There are 51 different initial game positions modulo rotation. Score differeces (Bank1-Bank2) B : Initial Game Position O : Optimal score difference for the first player G1: Best score difference when first player plays according to a one-step look-ahead greedy strategy G2: Best score difference when first player plays according to a two-step look-ahead greedy strategy R : Score difference when first player plays by random choice Case B O G1 G2 R ---- -------------- --- --- --- --- 1 4 4 4 2 2 2 2: 4 -6 -4 -2 2 3 4 4 3 2 2 2: 4 -6 -2 -10 3 3 4 3 4 2 2 2: 2 -8 -10 -12 4 3 3 4 4 2 2 2: 4 -2 -4 -8 5 4 4 3 2 3 2 2: 6 0 -8 -8 6 3 4 4 2 3 2 2: 2 -2 -6 -12 7 3 4 3 3 3 2 2: 6 0 -8 -6 8 4 2 4 3 3 2 2: 2 -8 -4 -6 9 3 3 4 3 3 2 2: 2 -4 -4 -6 10 4 2 3 4 3 2 2: 2 0 -2 -8 11 3 3 4 2 4 2 2: 6 0 -4 -8 12 4 3 2 3 4 2 2: 6 -8 -2 -8 13 3 4 2 3 4 2 2: 2 -2 -4 2 14 4 2 3 3 4 2 2: 4 -2 -2 -2 15 3 3 3 3 4 2 2: 2 -2 -8 -8 16 3 2 3 4 4 2 2: 4 -8 -6 -8 17 4 3 3 3 2 3 2: 2 -6 -4 -4 18 4 2 4 3 2 3 2: 2 0 -2 -2 19 3 3 4 3 2 3 2: 6 -6 -4 -2 20 4 3 3 2 3 3 2: 4 -2 -6 -2 21 3 4 3 2 3 3 2: 2 -4 -2 -4 22 4 2 4 2 3 3 2: 4 -4 -4 -8 23 4 3 2 3 3 3 2: 4 -2 -4 -4 24 3 4 2 3 3 3 2: 4 0 -2 -8 25 4 2 3 3 3 3 2: 2 -4 -2 -4 Not used 4 4 3 3 2 2 2: 4 4 -6 -6 4 3 4 3 2 2 2: 4 -4 -2 -8 4 4 2 4 2 2 2: 4 4 -2 -8 4 3 3 4 2 2 2: 2 2 -4 -6 4 2 4 4 2 2 2: 4 2 -8 -2 4 3 4 2 3 2 2: 2 2 -4 -8 4 4 2 3 3 2 2: 4 2 -4 -6 4 3 3 3 3 2 2: 2 2 -6 -8 4 3 2 4 3 2 2: 2 2 -2 -10 3 4 2 4 3 2 2: 6 4 -10 -6 3 3 3 4 3 2 2: 4 4 -6 -8 3 2 4 4 3 2 2: 6 4 -4 -8 4 4 2 2 4 2 2: 6 6 -8 -6 4 3 3 2 4 2 2: 4 -6 -8 -6 3 4 3 2 4 2 2: 4 4 -2 -6 4 2 4 2 4 2 2: 2 2 -8 -8 3 2 4 3 4 2 2: 4 -6 -6 -8 3 3 2 4 4 2 2: 6 4 -6 -12 4 4 2 3 2 3 2: 6 2 -2 0 3 4 3 3 2 3 2: 2 2 -2 0 4 3 2 4 2 3 2: 2 0 -2 -4 3 4 2 4 2 3 2: 2 2 -2 -8 4 2 3 4 2 3 2: 6 6 -4 -4 3 3 3 4 2 3 2: 6 2 -4 -8 3 3 4 2 3 3 2: 4 2 -2 -6 3 3 3 3 3 3 2: 2 2 -2 2 The dialog between your program and the opponent program is recorded in the file ioiwariX.report for test case X.