Author: Uri Blass
Date: 05:06:00 08/30/05
Go up one level in this thread
On August 30, 2005 at 05:11:07, Joachim Rang wrote: > >>Or you can store 2 tables -- one with Win/No Win, and other with Lost/No Lost. >>Presumable they will compress even better, and in lot of cases during the search >>you will probe only one of them, because that is all you need to know. >> > >Just a crazy idea from a non-techie: Couldn't you store only win/draw in a table >and simply skip all lost positions and tell the chess program that in case there >is no entry for a position it is lost? > >regards Joachim Maybe better experts than me will answer but I will share my thoughts about it. How do you do it? basically every position is translated to a number. The way that chess programs find if position is a draw or win or a loss is that they translate position to a number and the number tell them where to look in a big array to tell them the result when 1 is win and 0 is not win. How do you expect a program to find that there is no entry for a position? If you do it by another number then you need to use more than 1 bit. The only way that I think that your idea can be used is by having an array with the winning numbers and and an array with drawing numbers(remember that every number represent postion) but in that case the numbers in the array are big and need a lot of memory. In theory you can compress the array of the winning number and the array of the drawing numbers but I suspect that in this case it will be harder to find if a number is inside the winning numbers or the drawing numbers and it may take more time. Uri
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.