Hacker News new | past | comments | ask | show | jobs | submit login

Once there are only a few pieces left, chess seems like a solvable game.

With three pieces there’s about 250000 positions, can’t a modern computer just check them all?




Indeed; endgame tablebases have been constructed for all positions with up to 7 pieces (including kings), and at some point in the not too distant future, we expect to have all 8 piece ones as well.

https://en.wikipedia.org/wiki/Endgame_tablebase


3 pieces is two kings and one other piece. That’s easy (I think it can be summed up as “draw if that piece is a knight or a bishop, won otherwise, unless the piece can be taken in move 1 or the starting position is a stalemate”)

It gets harder fairly rapidly as you add pieces.

What you describe is a tablebase. https://en.wikipedia.org/wiki/Endgame_tablebase:

“By 2005, all chess positions with up to six pieces (including the two kings) had been solved. By August 2012, tablebases had solved chess for every position with up to seven pieces (the positions with a lone king versus a king and five pieces were omitted because they were considered to be "rather obvious")”


Oh yes I forgot the kings are 2 already.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: