Thanks, I am not much of a checkers player either. Thought it might be a challenge to code some AI because this game is pretty boring me playing against myself :P though, I am picking up some strategies for board position and move timing.
I was checking out maxmin and alpha-beta pruning today and learned checkers has been "solved" both players play perfect game and it ends in draw (machine learning). This gave me a radical idea but I need to know more about end game draws, like when it is time to call one.
https://spectrum.ieee.org/computing/software/checkers-solvedCheckers is like tic-tac-toe: You can never win; you can only lose. IF you play a perfect game and your opponent plays a perfect game, the game will
always result in a draw. Only when somebody screws up and makes a non-perfect move will there be a “winner” — and in a case like that, can you
really call yourself a winner??
Isn’t it just a case where the other guy is simply a loser?? THEY screwed up and lost. YOU didn’t really
earn a win! Ergo...
Checkers is just a game losers play! :P
Eventually, I imagine we’ll learn a lot of our games end up the same. Chess, go, poker.... We just haven’t computed all the possible combinations yet, but I imagine eventually humanity will discover that as long as both sides play perfectly, all games will end in a draw....
Which leaves me to think:
Heaven must be an awfully boring place, since we’re all supposed to be perfect once we go there...