Search found 16793 matches

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: 70849

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: 70849

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: 70849

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: 70849

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...
by bob
Mon Apr 02, 2007 3:56 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SEE on non-capture moves in main search
Replies: 62
Views: 70849

Re: SEE on non-capture moves in main search

That would stretch the clock cycle time for _everything" since the clock cycle time has to be long enough for the most complex circuit in the thing to settle. MVV/LVA requires two minor cycles in a hardware implementation. First cycle is find the most valuable attacked piece (victim), second cycle ...
by bob
Mon Apr 02, 2007 2:05 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SEE on non-capture moves in main search
Replies: 62
Views: 70849

Re: SEE on non-capture moves in main search

Then please cite a solution to the following problem. A hardware chess implementation is a finite state machine with a static cycle-time. So how are you going to implement a SEE that can do its thing in one cycle that is a constant-time thing? You can't. Either you stretch the cycle time out horren...
by bob
Mon Apr 02, 2007 1:57 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SEE on non-capture moves in main search
Replies: 62
Views: 70849

Re: SEE on non-capture moves in main search

MVV/LVA is the only viable solution when using special-purpose hardware. Clearly not. Then please cite a solution to the following problem. A hardware chess implementation is a finite state machine with a static cycle-time. So how are you going to implement a SEE that can do its thing in one cycle ...
by bob
Mon Apr 02, 2007 1:54 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Fantacising about a testing cluster!
Replies: 21
Views: 23962

Re: Fantacising about a testing cluster!

I want to be able to run a two month test for the most promising beta that is produced each week. So ten cpus should be enough. They should be as cheap as possible (celerons maybe) with no more than 256 MB each. I imagine that they all could connect to a main computer through a simple network that ...
by bob
Sun Apr 01, 2007 1:59 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SEE on non-capture moves in main search
Replies: 62
Views: 70849

Re: SEE on non-capture moves in main search

Can we stop with the blanket statements that are wrong? "no serious engine uses MVV/LVA". Let me name a few, from older to newer: (1) Belle (2) chiptest (3) deep thought (4) deep blue (5) dark thought (6) Hydra Well, so I left out the "anymore", obviously there has been a time when MVV/LVA was quit...
by bob
Sun Apr 01, 2007 1:51 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SEE on non-capture moves in main search
Replies: 62
Views: 70849

Re: SEE on non-capture moves in main search

Again, read _what_ I wrote. QxR wins a pawn (queen for 2 rooks). That is a winning exchange by SEE. It should _not_ be searched prior to RxN which wins a knight. Perhaps, but this particular case (which is not at all common in practise) is one of the very few cases where it is no longer possible to...