TalkChess.com :: View topic - A search enhancement?

TalkChess.com
Hosted by Your Move Chess & Games

FAQ

Memberlist

Usergroups

Profile

A search enhancement?

TalkChess.com Forum Index -> Computer Chess Club: Programming and Technical Discussions

View previous topic :: View next topic

Author

Message

Vincent Diepeveen

Joined: 09 Mar 2006
Posts: 1738
Location: The Netherlands

Post subject: Re: A search enhancement? Posted: Tue May 01, 2012 12:01 pm

Ferdy wrote:

dchoman wrote:

Thanks everyone for the reference to LMP. It indeed appears to be essentially the same idea. I do have one question. In LMP, does one make every move and then prune them each individually... or does the whole remainder of the movelist get pruned in one go after a certain point.... or do different implementations do it differently? The former (move by move) might be safer than what I was trying (remainder in one go). I was worrying about missing a good check or something late in the movelist (as another poster also pointed out) and the move by move approach would avoid that, although it would be slower.

Is there a preferred approach?

- Dan

I guess your idea is new, I have seen others just doing move prunning only, but yours is shall I say late move iteration prunning because you are prunning the whole iteration.
I tried your idea at higher depths and very late moves in move list without even bothering the depth specific value and got encouraging result.
There are some positions in the search that even a check move would not be able to do anything, so this approach is the solution.

Implementation technical you're correct, but that doesn't count as a 'new prunings idea' IMHO, as otherwise every different way to implement something also must be seen as a 'new algorithm', which is a simple way to total refute it as a new idea.

Note that i'd take the +30 elo.

Bit amazed he doesn't except for giving checks either.

For Diep any of this doesn't work currently, though i retest things like this every few years though.

A problem there is always that for example a move like Na6-c5, a simple shuffle move is going to improve the evaluation always more than what most pawncaptures add to the evaluation.

Display posts from previous:

Subject	Author	Date/Time
A search enhancement?	Daniel Homan	Mon Apr 30, 2012 12:18 pm
Re: A search enhancement?	F. Bluemers	Mon Apr 30, 2012 12:25 pm
Re: A search enhancement?	Ronald de Man	Mon Apr 30, 2012 1:57 pm
Re: A search enhancement?	Lucas Braesch	Mon Apr 30, 2012 2:06 pm
Re: A search enhancement?	Jon Dart	Mon Apr 30, 2012 2:46 pm
Re: A search enhancement?	Daniel Homan	Mon Apr 30, 2012 8:01 pm
Re: A search enhancement?	Jon Dart	Tue May 01, 2012 12:24 am
Re: A search enhancement?	Ferdinand Mosca	Tue May 01, 2012 5:47 am
Re: A search enhancement?	Vincent Diepeveen	Tue May 01, 2012 12:01 pm
Re: A search enhancement?	Daniel Homan	Tue May 01, 2012 8:45 pm
Re: A search enhancement?	Joona Kiiski	Mon Apr 30, 2012 2:35 pm
Re: A search enhancement? -- Update	Daniel Homan	Sat May 05, 2012 10:44 am
Re: A search enhancement? -- Update	Jon Dart	Sat May 05, 2012 11:32 pm
Re: A search enhancement? -- Update	Joona Kiiski	Sun May 06, 2012 4:22 pm
Re: A search enhancement? -- Update	Uri Blass	Sun May 06, 2012 8:12 pm
Re: A search enhancement? -- Update	Joona Kiiski	Mon May 07, 2012 7:41 am
Re: A search enhancement? -- Update	Uri Blass	Mon May 07, 2012 8:31 am
Re: A search enhancement? -- Update	F. Bluemers	Mon May 07, 2012 5:14 pm
Re: A search enhancement? -- Update	Matthew R. Brades	Tue May 08, 2012 2:56 pm

TalkChess.com Forum Index -> Computer Chess Club: Programming and Technical Discussions

You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum