09 Dec '08 19:41>
What is the fastest slatemate possible in chess? From the bigenning.
Originally posted by SophyI meant it would be too easy to pick apart your spelling and grammar. The fastest stalemate appears to belong to well-known puzzle composer Sam Loyd:
Then, can you show it to me ?
Originally posted by afxNot so easy to do that, even for silicon.
Lloyd showed us this beautiful stalemate in 10..
But nobody proofed, that this is really the fastest one.
Did anyone //proof//, that there is no stalemate in 9?
Even with the silicon friend?
Originally posted by SwissGambitI did not say, that it is easy!
Not so easy to do that, even for silicon.
18 ply of brute-force calculation takes a looooong time still. [Plus you need a custom-written program just for the task.]
Originally posted by afxI'm not sure about your use of terminology.
I did not say, that it is easy!
Brute force is obviously the wrong way.
But think of a retro game, b.f. would be no solution, either!
You have here a very complicated retro, even the end position
is not fixed, just the 18 ply and the stalemate.
The "custom written program" is not the problem. Firstly, in principle
you need one for every retro game.
Secondly, I could use the one I have written already ;-)