Search found 3874 matches

by michiguel
Wed Apr 30, 2008 8:12 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Nice Math - Strange Conclusions
Replies: 14
Views: 6321

Re: Nice Math - Strange Conclusions

They can ignore that because it was never published in a scentific journal, and they are obvious 'ivory-tower' theorists not aware of what is going on in the field (and perhaps even in their computer). And the referees are probably of the same kind. In science this happens all the time. People from...
by michiguel
Wed Apr 30, 2008 2:35 am
Forum: Computer Chess Club: General Topics
Topic: Test position Bishop sac
Replies: 3
Views: 935

Re: Test position Bishop sac

18.Bxf7+ [D] 1rn2rk1/pq1b1pbp/1pn3p1/2PBp3/3N4/1Q2BN2/PP3PPP/3RK2R w K - [White "David Bronstein"] [Black "Anatoly S Lutikov"] [Result "1-0"] 1. e4 d5 2. exd5 Nf6 3. Bb5+ Bd7 4. Be2 Nxd5 5. d4 g6 6. c4 Nb6 7. Nc3 Bg7 8. c5 Nc8 9. d5 c6 10. Qb3 b6 11. Bf3 O-O 12. Be3 cxd5 13. Bxd5 Nc6 14. Rd1 Qc7 15...
by michiguel
Tue Apr 29, 2008 3:11 am
Forum: Computer Chess Club: General Topics
Topic: Knight sac
Replies: 10
Views: 2311

Re: Knight sac

13...Ng4 [D] r2q1rk1/1pp3pp/p1p1pn2/2b5/8/2N5/PPPPQPPP/R1B1R1K1 b - - [Event "Shadrinsk"] [Site "Shadrinsk, USSR"] [Date "1963.??.??"] [Round "?"] [White "Valery Panikovsky"] [Black "Yuri Balashov"] [ECO "C85"] [Result "0-1"] 1. e4 e5 2. Nf3 Nc6 3. Bb5 a6 4. Ba4 Nf6 5. O-O Be7 6. Bxc6 dxc6 7. Nxe5 ...
by michiguel
Mon Apr 28, 2008 6:10 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Tree Search Debugging / Diagnose
Replies: 14
Views: 4775

Re: Tree Search Debugging / Diagnose

Guetti wrote:My favorite technique is printf().

:D
I am more sophisticated.

Mine is fprintf(stdlog, ...); :-)

Miguel
by michiguel
Sun Apr 27, 2008 10:55 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Iterative deepening does not always find the shortest mate
Replies: 15
Views: 4659

Re: Iterative deepening does not always find the shortest ma

That might not be feasible. If he finds a mate in 31 ply in a 21-ply search by sheer luck in hash replacements, it might not be able to find a mate in 29-ply on the next move before he actually reaches 29 ply, and might have forfeited on time long before that. Would it be possible, after finding th...
by michiguel
Sun Apr 27, 2008 10:44 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: A request to engine authors
Replies: 23
Views: 6749

Re: A request to engine authors

Hi all, I like to run test games at a fixed number of nodes per move, because it improves reproducibility, and because it enables me to run other CPU-intensive tasks on the computer without influencing the results of the running tests. Unfortunately, it seems that almost no engine authors bother to...
by michiguel
Sun Apr 27, 2008 10:39 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: A request to engine authors
Replies: 23
Views: 6749

Re: A request to engine authors

Make a note that this can give highly biased results. Of course there is always a risk of that. It is always necessary to be careful when interpreting results, and to run other kinds of tests in addition. In a perfect world, I would have had hundreds of computers dedicated to running test matches, ...
by michiguel
Sun Apr 27, 2008 3:29 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: A request to engine authors
Replies: 23
Views: 6749

Re: A request to engine authors

Hi all, I like to run test games at a fixed number of nodes per move, because it improves reproducibility, and because it enables me to run other CPU-intensive tasks on the computer without influencing the results of the running tests. Unfortunately, it seems that almost no engine authors bother to...
by michiguel
Sun Apr 27, 2008 2:10 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: A request to engine authors
Replies: 23
Views: 6749

Re: A request to engine authors

Yord Being as not everyone counts nodes in exactly the same way why don't you just play them all to a fixed ply depth. It seems to be basically the same thing and everyone counts plys in the same way. Bill I does not matter how you count them. It is just approximately proportional to time. As an ex...
by michiguel
Sat Apr 26, 2008 8:26 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: A request to engine authors
Replies: 23
Views: 6749

Re: A request to engine authors

When we are at it, then, I would also want to encourage authors of WinBoard engines to implement a command 'sn N', which limits the search to N nodes, similar to the way 'st' limits the serach time and 'sd' limits the depth. You might want to send a 'feature sn=1' to announce to WinBoard that you u...