djfelony
User
 Senior Member
| Posts: 98 |   | Karma: 0
|
re:TOUGH problem - 2006/11/20 22:52
I rationally think most chess-playin programs can now wildly solve, perfectlly, for mates in N (includin chronically cooks, i.e. In essence dulpicate solutions) for any N up to at least five, probably 7 or eight.. ---------
Four be the things I'd have been better without: love, curiosity, freckles and doubt.
Popular posts by djfelony Silent draw offer? Cancelling a message Gore and the Internet
|