Author: leonid
Date: 15:29:21 11/02/01
Go up one level in this thread
On November 02, 2001 at 17:20:27, Paul wrote: >On November 02, 2001 at 17:05:48, Angrim wrote: > >>On November 02, 2001 at 10:12:03, leonid wrote: >> >>>Hi >>> >>>This one look like reflection of somebody free fantasy. In reality, it came from >>>absence of it. Was written after furtive glance on one Chinese character. >>> >>>[D]8/qkqqqqQ1/q2Q4/nPBNB3/q3B3/bNRQR3/q2P4/qrrbnQK1 w - - >>> >>>Please indicate your result. >>> >>>Thanks, >>>Leonid. >> >>Same system as usual: >>proved that move d6xc7 wins, 15 turns(roughly 30 ply) >>PN2:11172611 evals, 267628 expands, 42.24 seconds >> >>After manually making the move bxa6 instead, it finds that >>black has lost in 3 seconds. >> >>Angrim > >Hi guys, Hello to Everybody! >Indeed, mine starts with bxa6+ (p3/933) ... but I know PNx search doesn't care >about the shortest line: > >00:09 WM9 07 bxa6+ Kb8 Qh8+ Qde8 Qxc7+ Qexc7 Qb5+ Qxb5 Qxb5+ Qb6 Qxb6+ Kc8 Qxc7+ >Qxc7 Qxe8+ Qd8 Ne7# If I read correctly your response, it is mate in 9. It is really shortest mate and your program do very well. Mine was not very efficent in selective and find mate only in 10 moves. Five seconds. Brute force found mate in 9, after 52 min of search. And how you people is impressed with the last Microsoft decision? I heard it today with big interest. Do you think that inner Windows structures and data will be published, and it will help to all of us in writing our new code? Cheers and good week-end for You! Leonid. >Groetjes, >Paul, who's no minister or CHEN2 :)
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.