Author: Antonio Dieguez
Date: 10:37:03 05/16/01
Go up one level in this thread
On May 15, 2001 at 20:28:25, Sam Gross wrote: >I am writing a bitboard-based chess engine in Java, and a preliminary test of >the search function (plain alpha-beta search, no transposition table, history, >null move, or anything else) was pretty disappointing. I am getting about 10% >of the nps crafty gets on the same machine, even though my evaluation function >is just the material imbalance. My question is, how much of this is due to >differences in speed between Java and C++, and how much is due to lack of a >transposition table (or other factors)? Also, I wonder if my program may be >stretching Java's automatic garbage collectors. A new copy of my board is made >for every node, and each node creates many instances of my move object, which I >imagine would use up a lot of time. Any help would be appreciated. Hi! I did a java chess program. Not bitboard based. A lot of arrays. And, just in case you want to know, when I translated it to c++ and compiling with cygwin, there was a factor of just 2 (I was dissapointed...). A bit later when I updated the applet a little(primary the eval) the factor... growed(?) to more or less 2.6... Anyway with the best compiler around and doing optimizations and in a newer computer than mine the c++ version can be much more faster. If you want to see my java source code(in wich there is nothing so special) is here www.geocities.com/zodiamoon/applete.html bye.
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.