Search found 825 matches

by wgarvin
Sat Jul 14, 2007 10:52 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: compiling glaurung
Replies: 23
Views: 9815

Re: compiling glaurung

You can use the compiler from a command prompt if you want, just search for vcvars32.bat and run that first. I find it a lot simpler to use the IDE though. (Edit: don't make a project from existing files, just start with a New Project"). You should select "Win32 Console application" and select "empt...
by wgarvin
Sat Jul 14, 2007 8:18 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: compiling glaurung
Replies: 23
Views: 9815

Re: compiling glaurung

Visual C++ 6 is pretty old, and notorious for not being able to compile code that works fine on other compilers.

You could try one of the free versions of MSVC 2005, they are much better: http://msdn.microsoft.com/vstudio/express/downloads/
by wgarvin
Wed Jul 11, 2007 4:15 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: iterative deepeniing and branching factor
Replies: 32
Views: 12310

Re: iterative deepeniing and branching factor

So this "side to move" bonus would cause the engine to score positions at even depths where it is to move, at 0.4 pawns above positions at odd depths where the opponent is to move. Is this basically pretending that the engine can do something, on average, worth 0.4 pawns in those positions? Or is th...
by wgarvin
Wed Jul 11, 2007 3:17 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Arena Variation Board
Replies: 2
Views: 1516

Re: Arena Variation Board

Like your question from yesterday, this question is more likely to find an answer in the General Topics forum.

This forum is mostly meant for programmers who are writing their own chess programs. (Its considerate to try and ask questions in the right place.)
by wgarvin
Tue Jul 10, 2007 2:00 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: iterative deepeniing and branching factor
Replies: 32
Views: 12310

Re: iterative deepeniing and branching factor

I think sometimes you can skip the first N-2 iterations anyways. If you play your best move and then the opponent responds with the predicted move, then all of the searches for the first N-2 iterations should be satisfied almost instantly by the hashtable. I remember reading something about this in ...