Author: Stuart Cracraft
Date: 16:20:09 07/07/04
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
This page took 0.01 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.