Originally posted by Ben Kenobi
Checkers hasn't been solved for all possible positions. It's only been solved for the strongest starting position.
Checkers has 10^31 moves on a 8x8 board, but chess has 10^138 moves. If we can't strongly solve Checkers, then we aren't ever going to strongly solve Chess.
Checkers hasn't been solved for all possible positions. It's only been solved for the strongest starting position.
Checkers has 10^31 moves on a 8x8 board, but chess has 10^138 moves. If we can't strongly solve Checkers, then we aren't ever going to strongly solve Chess.
Checkers was solved from the standard starting position. It wasn't solved for all positions because it takes a lot of computational horsepower to do it. It takes 10^14 calculations to solve. It can be recomputed for any starting position without a single bit of code being changed in the software, it'll just take another ~10^14 calculations. Given the growth of computational power, that's going to happen increasingly quickly. No one's attempted yet because it's kind of pointless. But it's 100% certain to be possible, so your assertion that we can't solve checkers is absolutely false.
Both Checkers and Chess are absolutely solvable. It's a question of computational horsepower to get it done, but it's solvable. Checkers is considered solved, Chess is well on its way. Subsets are already solved, and as computational power increases, so too does the size of the set that is solved.
As usual, I don't think you understand the basics of anything you talk about.
Comment