Computer Chess Club Archives

Search

Messages

Subject: Re: Is this solvable by brute force?

Author: Joel

Date: 07:59:05 09/18/03

Go up one level in this thread

He mentioned without using hash-tables.

Even using them I am still doubtful, though you could perhaps be more
knowledgeable on this subject than me.

I would be a lot more confident after having actually sat down to do the math to
see how effective recognising transpositions could be.

Anyhow, if you could solve that problem in a day from scratch, I would be quite
suprised! That 'good' evaluation function which you speak of to effectively
reduce the required depth of the minimax search would take more than just a wave
of the hands.

Maybe a few days! :)

Joel

• Re: Is this solvable by brute force? Joel 08:05:15 09/18/03
  • Re: Is this solvable by brute force? Vincent Diepeveen 17:32:28 09/18/03
    • Re: Is this solvable by brute force? Joel 18:31:58 09/18/03
      • Re: Is this solvable by brute force? Uri Blass 19:42:53 09/18/03
        • Re: Is this solvable by brute force? Joel 19:59:11 09/18/03
          • Re: Is this solvable by brute force? Joel 20:07:56 09/18/03
  • Re: Is this solvable by brute force? Edward Seid 08:15:13 09/18/03
    • Re: Is this solvable by brute force? Joel 18:40:38 09/18/03
    • Re: Is this solvable by brute force? Vincent Diepeveen 17:24:31 09/18/03
    • Re: Is this solvable by brute force? J. Wesley Cleveland 10:24:45 09/18/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.