chess:programming:de_bruijn_sequence:about_de_bruijn_sequences
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| chess:programming:de_bruijn_sequence:about_de_bruijn_sequences [2021/10/28 14:16] – [B(6,2)] peter | chess:programming:de_bruijn_sequence:about_de_bruijn_sequences [2021/10/28 14:19] (current) – [Chess - Programming - de Bruijn Sequence - About De Bruijn Sequences] peter | ||
|---|---|---|---|
| Line 27: | Line 27: | ||
| * The answer is **Yes**, it is possible to make a non-repeating sequence of numbers that covers every sub-sequence internally, just once. | * The answer is **Yes**, it is possible to make a non-repeating sequence of numbers that covers every sub-sequence internally, just once. | ||
| * This is a de Bruijn Sequence. | * This is a de Bruijn Sequence. | ||
| + | |||
| + | * See [[Chess: | ||
| </ | </ | ||
chess/programming/de_bruijn_sequence/about_de_bruijn_sequences.1635430588.txt.gz · Last modified: 2021/10/28 14:16 by peter