Author: Nicolas Carrasco
Date: 16:45:10 12/23/99
Go up one level in this thread
I thought they were magic, but relized that not on these days. In my opinion and SUPER CRITIC STYLE of chess programing I agree that ROTATED BITBOARDS are the best variant if you are a good programer. If you don't want to deal with so many 0 and 1s try TSCP or GNU chess board representation. But I tested ALL them with STRICT stats and realized that BITBOATDS is the path. MERRY CHRISTMAS! On December 23, 1999 at 00:55:15, Bruce Moreland wrote: >On December 22, 1999 at 18:12:43, hgkjhg wrote: > >>Hi, >>I started writing a program. It was a running bug-free program. But I want to >>mainly change its eval.c function. The program initially doesn't have a lot of >>knowledge, but its speed is about 2.5 times slower than crafty's on a Pentium >>100. The program uses regular 12x12 offsets for board representation, and it >>seems to be easy to add knowledge, but would the program be like 300% faster >>using bitboards? > >Bitboards are not magic. They are just another way of doing move generation. >Depending upon what the program is trying to do, you can have a move generator >that's twice as fast and only speeds the program up a few percent. > >bruce
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.