@10328
"It's too bad there isn't a fifty-move rule for Internet arguments."
Repetitio mater studiorum.
Repetition is the mother of study.
Many here still do not understand that it is not necessary to strongly solve a game to weakly solve it and that it is not necessary to weakly solve a game to ultra-weakly solve it.
@MARattigan
Martin -
now a more direct reply by me.
You're saying that the tablebases haven't even Rigorously solved for three pieces on the board?
Quote from your post:
"A practical algorithm to completely determine what positions are illegal from either all or particular FRC positions or just from the standard chess starting position is not currently known."
I would think it would be easy for three pieces.
Try this Martin - as long as Kings aren't adjacent and pawns are on any of their 48 squares - then all positions of three pieces with either side to move are all legal and legally reachable. Can you show an exception to the forum?
You don't need to worry about the starting position there.
There's your 'algorithm' right there.
This is easy enough for a human being that I would think that computers could easily handle four - and five with time. Time they've more than had.
But six pieces - that's something else.
The 500 multipliers begin to 'cut in'.
---------------------------------------------
Plus people thinking 'only legal positions need be considered' are missing the point that to find all legal positions you need to find and 'exclude' all the illegal ones.
Plus if you're doing that anyway in the project there's no reason to exclude the illegal positions from cataloguing.
A position is punched in ...
computer responds: 'Cannot be solved because its illegal.'
Or - 'Is not solved here because its legally unrecheable - see side project for further cataloguing of 'solutions' of unreachable positions that are otherwise legal. ' (maybe no 'funding' for that one)