Author: KarinsDad
Date: 07:50:36 08/15/99
Go up one level in this thread
On August 14, 1999 at 12:32:00, blass uri wrote: >On August 14, 1999 at 03:29:37, Micheal Cummings wrote: > > > ><snipped> >>yours would only get interest from programmers, and chess programers at that. I >>would say that maybe, I might be wrong that people who write or tinkle in chess >>program would be under 10% on here. > >I do not think that programmers will be interested in this article because >I believe it is not going to help them to improve their programs. > >I am interested in counting problems and I think that it is impossible to >represent the legal positions by 20 bits in a simple way and if you need some >minutes to calculate the representation of a legal position then chess programs >are not going to use this representation. > >Uri I agree that this type of work is like climbing Mount Everest. You do it because it is there, not because it will have any practical value to anyone. However, I think you underestimate people's interests. I think people would read the article just because it has never been done before, not in an attempt to gain anything for their program. Note: My current algorithm is somewhat more complex to humans, but only slightly more complex for computer than any of the 24 byte algorithms that I have seen. If used to store random positions, it would be save space over the 24 byte solutions (that is, if I could get it to work for all cases). KarinsDad :)
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.