Author: Keith Evans
Date: 18:31:42 07/07/04
Go up one level in this thread
On July 07, 2004 at 19:20:09, Stuart Cracraft wrote: >Hi -- for various test reasons I need to be able to >take N strings > > A B C D .... N > >though not literally a total of N... rather any number of strings >and produce a list > ><blank> >A >B >: >: >N >A B >A C >: >: >A N >B C >B D >: >: >B N >A B C >A C D >A D E >: >: >.... > >for all possible combinations of the N strings >chosen N at a time down to 0 at a time (the null case.) > >Is there any software around that does that you know of? >Everything I've found is either permutation dependent >and N at a time (when I have no use for order) or >combination dependent and also N at a time rather than 0 .. N >(all possible combinations.) > >Thanks, > >Stuart You might enjoy looking at some of the fascicles at: http://www-cs-faculty.stanford.edu/~knuth/news.html
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.