Computer Chess Club Archives

Search

Messages

Subject: Re: why write a fast chess program ?

Author: Engin Üstün

Date: 12:02:45 08/17/02

Go up one level in this thread

i sad the most of programs today not all.
sorry but i want not discuss wich programs are fast or used bitboards.

i meaned is not exist other ways to write a strong engine using selective
methods.
i mean not null move or extensions.
to try 1-5 moves per position not more and reduce the nodes and search tree
extremently.
problem is what 1-5 moves are there to try search.
i know that is a old idea, but i see nobody of programers are to try this way.

programs been faster and faster, is that the only one way?

• Re: why write a fast chess program ? Stuzzi Kadent 09:46:50 08/18/02
• Re: why write a fast chess program ? Vincent Diepeveen 20:07:08 08/17/02
  • Re: why write a fast chess program ? Engin Üstün 22:46:37 08/17/02
    • Re: why write a fast chess program ? Vincent Diepeveen 07:43:25 08/18/02
      • Re: why write a fast chess program ? Robert Hyatt 19:57:11 08/18/02
    • Re: why write a fast chess program ? Uri Blass 00:21:47 08/18/02
• Re: why write a fast chess program ? Jason Williamson 15:41:20 08/17/02
  • Re: why write a fast chess program ? Engin Üstün 22:49:03 08/17/02

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.