Author: Bert van den Bosch
Date: 19:09:38 03/08/04
Hello all, Just to tell you I joined this forum today. My name is Bert van den Bosch from the Netherlands, and I've started programming an engine in java, which can already play on icc. Actually I've a question. I have chosen some particular structure for my program. That is, a table which keeps track of all possible moves. In other words I don't have a move generator(well implicitly I have, off course the moves have to come out), but I adapt my movelist when I do piece inserts and deletes. What I want to be doing is trying to store a move, and its implications on the board and try to find it later when the same move comes up in the search tree, and when the move is locally the same (as in it affects the same pieces on the board) then I'd be able to make the move faster and know already the change in value of the position. It's somewhat like searching for the same position which I guess is well known, but on a local scale. Anyone any experience with this? I've already tried it, it had some bugs, and I found that in about 80% of the times the move already made before could be applied again. In which case my program is able to make the move (node) 10 times faster so it would be nice if I could find the move fast in some nice datastructure. greetings Bert
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.