Computer Chess Club Archives

Search

Messages

Subject: Re: Permuting and Combining

Author: GuyHaworth

Date: 16:54:30 07/07/04

Go up one level in this thread

These are not difficult algorithms to concoct or find in the literature.

If you want to go to 'the bible', it's TAOCP by Knuth, see:

http://www-cs-faculty.stanford.edu/~knuth/taocp.html

and scan down to pick up 'pre-fascicle 2a' on 'Generating all n-tuples'

... or maybe there's something in 'Fundamental Algorithms', v1.


g

• Which Version of Your Program is Best? (was Re: Permuting and Combining) Stuart Cracraft 18:37:34 07/07/04
  • Re: Which Version of Your Program is Best? (was Re: Permuting and Combining) Dieter Buerssner 12:09:32 07/08/04
• <Sorry didn't read this before I posted NT> Keith Evans 18:32:54 07/07/04

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.