Computer Chess Club Archives

Search

Messages

Subject: Pure Negamax problem

Author: Andrew Wagner

Date: 16:17:15 02/15/04

Ok, I'm working on a .Net engine, as many of you know. I'm starting simple by
just implementing a pure negamax search and right now I'm just trying to find
the root move. If I search with a depth of 1, 3, or 5, I'm fine (though my
engine oddly likes Na3, but that's an eval problem). However, if I search with a
even depth like 2 or 4 moves, it's returning a BLACK move at the root. I've
tested my move-generator and takeback routine thoroughly, and can't find the
problem. The code for the negamax routine is at:

 http://www.lechess.com/search.txt

It's in vb.net, but it's very readable. Can anyone see what the problem is?

• Re: Pure Negamax problem Andrew Wagner 05:52:42 02/16/04
• Re: Pure Negamax problem Michel Langeveld 21:05:42 02/15/04
  • Re: Pure Negamax problem Andrew Wagner 05:46:52 02/16/04
• Re: Pure Negamax problem Charles Roberson 19:05:39 02/15/04
  • Re: Pure Negamax problem Andrew Wagner 05:50:15 02/16/04
• Re: Pure Negamax problem Charles Roberson 18:38:54 02/15/04

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.