Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How much of a Genius must one be to create a 2400+ Program

Author: Tom Kerrigan

Date: 12:10:31 04/26/00

Go up one level in this thread


On April 26, 2000 at 11:18:10, Dave Gomboc wrote:

>On April 26, 2000 at 03:59:17, Tom Kerrigan wrote:
>
>>On top of that, you have to know about alpha-beta. I have met a number of CS
>>grads who remember that minmax/alpha-beta is an algorithm but can't remember
>>what it's used for, much less how to implement it. And I'm sure that even the
>>best AI classes would not cover stuff like quiescence searches.
>
>Quiescence search was discussed in the initial AI class that I took back during
>my undergraduate program.  The professor wasn't a games person, but it was
>discussed during the section of the course on game-tree search.

My bad, then.

The AI classes at schools that I know about are almost all devoted to neural
networks and genetic algorithms and so forth. Very little about tree searching.
So, depends on which school you go to.

-Tom



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.