Search found 16819 matches

by bob
Thu Apr 05, 2007 7:20 pm
Forum: Computer Chess Club: General Topics
Topic: WCCC 2007
Replies: 24
Views: 26898

Re: WCCC 2007

The ICGA is in the final stage of negotiation for organizing the WCCC 2007, the 12th Computer Olympiad, and an accompanying scientific workshop . The events would take place in Amsterdam, The Netherlands at the end of June / beginning of July 2007. Further details will be announced as soon as possi...
by bob
Wed Apr 04, 2007 7:44 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Fantacising about a testing cluster!
Replies: 21
Views: 24258

Re: Fantacising about a testing cluster!

I like to test at 60/60 time controls. 60 minutes on the clock, 60 seconds per move added. That turns into 4-6 hours per game. or 6-8 games per day. 30 days isn't enough games to determine if version X is better than version X-1 at that speed. It takes more than a hundred games or two with two oppo...
by bob
Tue Apr 03, 2007 9:24 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SEE on non-capture moves in main search
Replies: 62
Views: 72023

Re: SEE on non-capture moves in main search

Even if you take an infinite number of positions it would still be meaningless if you did not measure tactical strength. Because you would select the move ordering systematically to reduce more moves by LMR, by putting poor, but non-reducible moves (like bad captures) in front, just to put interest...
by bob
Tue Apr 03, 2007 9:23 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SEE on non-capture moves in main search
Replies: 62
Views: 72023

Re: SEE on non-capture moves in main search

Don't underestimate my abilities here :) There is no need to act stupid even if it is possible... Captures are a very special and easy to detect cases. What you say is in general applicable to every move ordering test, LMR on or off. There are other pruning methods. If you look above you will see h...
by bob
Tue Apr 03, 2007 7:28 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Fantacising about a testing cluster!
Replies: 21
Views: 24258

Re: Fantacising about a testing cluster!

I like to test at 60/60 time controls. 60 minutes on the clock, 60 seconds per move added. That turns into 4-6 hours per game. or 6-8 games per day. 30 days isn't enough games to determine if version X is better than version X-1 at that speed. It takes more than a hundred games or two with two oppo...
by bob
Mon Apr 02, 2007 8:53 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Fantacising about a testing cluster!
Replies: 21
Views: 24258

Re: Fantacising about a testing cluster!

I like to test at 60/60 time controls. 60 minutes on the clock, 60 seconds per move added. That turns into 4-6 hours per game. or 6-8 games per day. 30 days isn't enough games to determine if version X is better than version X-1 at that speed. It takes more than a hundred games or two with two oppon...
by bob
Mon Apr 02, 2007 6:46 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SEE on non-capture moves in main search
Replies: 62
Views: 72023

Re: SEE on non-capture moves in main search

I don't get why you turn LMR off during move ordering tests. Why not turn off killers or hash tables? They are all both dependent of the move ordering and will also change the move ordering. If there is a combined effect from LMR and different move ordering methods you want to catch that right? /Pe...
by bob
Mon Apr 02, 2007 6:44 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SEE on non-capture moves in main search
Replies: 62
Views: 72023

Re: SEE on non-capture moves in main search

You can't do it all in parallel. You have to use some sort of "tree" to reduce it down to a single answer. Which is a tree of depth 6 for 64 squares... Each square could find its own answer easily, but then they have to "get together" and figure out which is the "best answer" and that adds sequenti...
by bob
Mon Apr 02, 2007 6:40 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SEE on non-capture moves in main search
Replies: 62
Views: 72023

Re: SEE on non-capture moves in main search

You can't do it all in parallel. You have to use some sort of "tree" to reduce it down to a single answer. Which is a tree of depth 6 for 64 squares... Each square could find its own answer easily, but then they have to "get together" and figure out which is the "best answer" and that adds sequenti...
by bob
Mon Apr 02, 2007 3:57 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SEE on non-capture moves in main search
Replies: 62
Views: 72023

Re: SEE on non-capture moves in main search

There are probably some interactions with LMR since changing the ordering changes the history values and such which changes the pruning in odd ways. Yes. For this reason, I think it is best to disable LMR while doing move ordering tests. Tord It's a catch-22. Since LMR is used normally, removing it...