Author: Dann Corbit
Date: 14:39:00 02/27/06
Go up one level in this thread
On February 27, 2006 at 16:40:17, Gerd Isenberg wrote: >On February 27, 2006 at 16:29:10, Dann Corbit wrote: > >>From: >>http://www.jjj.de/fxt/demo/comb/ >> >>This stuff may prove interesting: >>subset-debruijn-out.txt is the output of subset-debruijn-demo.cc. >>Description: Generate all subsets in De Bruijn order. >>The demo uses the functions from subset-debruijn.h >>(fxt/src/comb/subset-debruijn.h) >> >>The steadily growing "Algorithms for programmers" text found at: >>http://www.jjj.de/fxt/fxtpage.html#fxtbook >>is well worth reading. > > >Thanks Dann, >will have a closer look. >Actually Steffan's solution looks quite optimal. Generation of subsets is a VERY IMPORTANT mathematical problem. If you have found something that is better than known methods as far as optimality of the algorithm, it would be important to publish it.
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.