Computer Chess Club Archives

Search

Messages

Subject: Re: FPGAs playing chess--an expert opinion

Author: Tom Kerrigan

Date: 16:25:55 12/18/99

Go up one level in this thread

The parallelism they are talking about isn't like parallel alpha-beta searching,
rather parallel algorithms for e.g. move generation. It is possible for digital
logic to generate all the possible moves for an entire position in just one
clock cycle...

-Tom

On December 18, 1999 at 12:31:11, Dan Andersson wrote:

>The replies so far overestimates the usefullness of FPGA technology, that is
>natural as they most probably have a bias. The parallelism in chess is variable
>and the dependecies in the search many and in some cases insolouble.
>
>regards DAn

• Re: FPGAs playing chess--an expert opinion Ti m Eccles 16:21:14 12/19/99
• Re: FPGAs playing chess--an expert opinion Dan Andersson 04:13:46 12/19/99
  • Re: FPGAs playing chess--an expert opinion Tom Kerrigan 17:00:17 12/19/99
    • Re: FPGAs playing chess--an expert opinion Robert Hyatt 19:00:13 12/19/99
  • Re: FPGAs playing chess--an expert opinion Vincent Diepeveen 14:36:56 12/19/99

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.