For measuring how well our NN is doing, we can compare it with perfect solvers for the games. This should be really easy to find for tic-tac-toe, and there are tablebases for simple chess positions with up to 7 pieces on the board; I'm not sure where we can find one for connect 4, but maybe there's something out there? or some algorithm?
To start with I guess this could just be a list of where to find these perfect solvers, and later we can get them into the repo itself.
For measuring how well our NN is doing, we can compare it with perfect solvers for the games. This should be really easy to find for tic-tac-toe, and there are tablebases for simple chess positions with up to 7 pieces on the board; I'm not sure where we can find one for connect 4, but maybe there's something out there? or some algorithm?
To start with I guess this could just be a list of where to find these perfect solvers, and later we can get them into the repo itself.