Connect Four Positions that our best AlphaZero model + 10000 MCTS sims could not get right

gistfile1.txt

For display purposes, 100% is rounded down to 99%

O's turn:
 -  -  -  -  -  -  -
 -  -  -  -  -  -  -
 -  -  -  -  -  -  X
 -  -  X  O  -  -  X
 -  -  O  X  -  -  O
 -  X  O  X  -  -  O
--------------------
 0  0  19 80 0  0  0   < Computed
 0  0  99 0  0  0  0   < Solution

X's turn:
 -  -  -  -  -  -  -
 -  -  -  -  -  -  -
 -  -  -  -  -  -  -
 O  -  -  -  -  -  -
 O  X  -  O  -  -  -
 X  O  X  X  -  -  -
--------------------
 2  58 0  0  28 0  9   < Computed
 99 0  0  0  0  0  0   < Solution

X's turn:
 -  -  -  -  -  -  -
 -  -  -  -  -  -  -
 O  -  -  -  -  -  -
 O  X  -  -  -  -  -
 X  O  -  -  X  -  -
 X  O  X  X  O  -  O
--------------------
 0  96 0  0  2  0  0   < Computed
 0  0  0  0  99 0  0   < Solution

O's turn:
 -  -  -  -  -  -  -
 -  -  -  -  -  -  -
 -  X  -  -  X  O  -
 -  O  -  O  O  X  -
 X  O  -  O  X  X  -
 O  X  X  X  O  X  O
--------------------
 21 33 0  0  19 0  24  < Computed
 99 0  0  0  0  0  0   < Solution

X's turn:
 -  -  -  -  -  -  -
 -  -  O  -  -  -  -
 -  -  X  -  -  -  -
 -  -  O  -  -  -  -
 -  -  X  -  -  X  O
 -  X  O  -  -  O  X
--------------------
 61 0  0  0  29 7  0   < Computed
 0  0  0  0  50 50 0   < Solution

O's turn:
 -  -  -  -  -  -  -
 -  -  -  O  -  O  -
 -  -  -  O  -  X  -
 -  -  -  X  -  X  -
 X  -  -  O  -  X  -
 X  -  X  O  O  O  X
--------------------
 0  98 0  0  0  0  0   < Computed
 0  0  99 0  0  0  0   < Solution

O's turn:
 -  -  -  -  -  -  -
 -  -  -  -  -  -  -
 -  -  X  -  -  -  -
 -  -  X  O  -  -  -
 -  -  O  X  -  -  O
 X  X  X  O  -  -  O
--------------------
 0  5  86 3  0  0  3   < Computed
 0  50 0  0  0  0  50  < Solution

X's turn:
 -  -  -  -  -  -  -
 -  -  -  -  -  -  -
 -  -  -  -  -  -  -
 -  -  -  -  -  -  O
 -  X  -  O  -  -  X
 O  X  X  O  -  O  X
--------------------
 0  45 0  53 0  0  0   < Computed
 0  99 0  0  0  0  0   < Solution

O's turn:
 -  -  -  -  -  -  -
 -  -  -  -  -  -  -
 -  -  -  -  -  -  -
 -  X  -  -  -  -  -
 -  O  -  -  -  -  -
 -  X  X  -  -  O  -
--------------------
 0  0  0  96 3  0  0   < Computed
 0  0  0  0  99 0  0   < Solution

O's turn:
 -  -  -  -  -  -  -
 -  -  -  -  -  -  -
 -  -  -  -  -  -  -
 -  O  -  -  -  -  -
 O  X  -  O  X  -  X
 X  O  O  X  X  O  X
--------------------
 0  18 0  0  41 3  36  < Computed
 0  99 0  0  0  0  0   < Solution

Hi,
I have put a comment on below your reddit post for your work on Connect 4 with AZ.
I copy it here, in case you do not check reddit.
Cheers,
Bruno

1. Very nice piece of work.

2. Another nice related piece of work is the following perfect solver developped by Pascal Pons a while ago : http://connect4.gamesolver.org/?pos=

3. With the help of the above link, it is actually easy to find more non expert moves. For instance, I played a game and compared the choices given by AZFour (Generation 50, max skill) and Pons' perfect solver:

AZFour is red, begins and should win. Yellow picks one the best decisions provided by Pons' solver.

AZFour makes a first mistake below

https://azfour.com/?model1=000050&model2=000050&skill1=7&skill2=7&autoplay1=false&autoplay2=false&discs=5,3;4,3;3,3;2,3;1,3;5,2;4,2;3,2;2,2;5,5

http://connect4.gamesolver.org/?pos=4444433336

Now, the game can be drawn by Yellow. A bit later, in the same game, AZFour makes another mistake:

https://azfour.com/?model1=000050&model2=000050&skill1=7&skill2=7&autoplay1=false&autoplay2=false&discs=5,3;4,3;3,3;2,3;1,3;5,2;4,2;3,2;2,2;5,5;5,0;4,5;1,2;5,6;4,6

http://connect4.gamesolver.org/?pos=444443333616377

And then Yellow catches a win position (and will not let it go, since it is optimal).

Have you thought measuring more extensively the number of mistakes, say on all possible solutions after n-plies with n reasonably small (say n<=10) ?