Three-checks games are typically short. I was wondering if there are attempts to solve this variant with powerful computers, and if there is a theoretical study of the possibility.
Hmm.... sounds interesting :)
It feels like White always should win.
no it can't be solved, but for sure there are forced winning lines right out the gate
*as in early in the game, not directly from the start
*as in early in the game, not directly from the start
What is "solvable" exactly mean? Does it mean within 10 years or what?
think of it like this
a computer crunches all the numbers and figuring out that no matter what moves black plays, he/she will not win. for every line possible
think of it like this
a computer crunches all the numbers and figuring out that no matter what moves black plays, he/she will not win. for every line possible
think of it like this
a computer crunches all the numbers and figuring out that no matter what moves black plays, he/she will not win. for every line possible
Sorry, I thought that solvable meant that the computer could figure out if one side wins or is should be a draw.
Like how checkers and connect-4 are solved, hence solvable.
This topic has been archived and can no longer be replied to.