How good are computers at solving chess helpmate problems, particularly long helpmates where one needs to form and execute a plan? (Also seriesmover problems.)
Can such planning techniques be used for regular chess? Or regular AI?
What is the distance to helpmate for a typical chess position? Constructing long helpmates is an impressive task.
No comments :
Post a Comment