Computer Chess Club Archives

Search

Messages

Subject: Re: search reductions?

Author: Uri Blass

Date: 04:17:37 11/17/03

Go up one level in this thread

On November 17, 2003 at 07:09:38, Tony Werten wrote:

>On November 17, 2003 at 03:06:33, Daniel Shawul wrote:
>
>>Hi folks
>>
>>I want my program to be a fast searcher.I used every
>>pruning technique I knew to make it fast.But it is not satisfying.
>>I am intending to use reductions intensively.Does anybody know a good
>>place to start?BTW,what else should I do to make my program fast?
>
>What makes you think your program will go faster with reductions ?
>
>Tony

I think that the poster means "going deeper" and not "going faster"

Uri

• Re: search reductions? Daniel Shawul 04:30:59 11/17/03
  • Re: No better place than what you've found rasjid chan 10:29:29 11/17/03
  • Re: search reductions? Anthony Cozzie 06:02:50 11/17/03
  • Re: search reductions? Tord Romstad 05:25:09 11/17/03
    • Re: search reductions? Sune Fischer 06:51:28 11/17/03
    • correction Daniel Shawul 06:25:44 11/17/03

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.