Author: Tony Werten
Date: 00:46:48 12/06/01
Go up one level in this thread
On December 04, 2001 at 16:34:15, Ren Wu wrote: >On December 04, 2001 at 04:40:31, Tony Werten wrote: > >>For those who have read the artical in the ICGA Journal. >> >>The Wu-Beal algoritm, how should I say it carefully, to me looks a lot like a >>simplification of something Urban Koistinen posted here 6 months ago ( complete >>text at www.abc.se/~m10051/eg.txt ). Biggest difference is that I can understand >>the ICGAJ artical in total. >> >>Does anybody else see simularities ? >> >>Tony > >Would you collaborate a bit on where/how you found these similarities? > >Ren. Sorry, I was busy with an interview and a childrens day (Kind of Santa Claus but then without Christmas) The main simularity ( and biggest improvement compared to standard generation) is the swithing from 1 big array with contains the endresults but is also used as "working" array, to a slow result array and smaller faster "working" bit arrays wich don't (need to ) contain all the knowledge of the result array. That is bassicly what your paper describes. Splitting the array and applying the standard stuff. ( wich resulted in a comprehensible and usefull article ) Urbans paper(snippet), though undoubtly less readable, seems to go way further. Tony
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.