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 revisionNext revision | Previous revision | ||
| chess:programming:de_bruijn_sequence:about_de_bruijn_sequences [2021/10/28 14:15] – 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: | ||
| </ | </ | ||
| Line 111: | Line 113: | ||
| * Rather than simple binary k=2, this is increased to k=6 to use possible values {0, | * Rather than simple binary k=2, this is increased to k=6 to use possible values {0, | ||
| * Reading this from left to right shows: 00, 01, 10, 02, 20 … 41, 15 … 33, 34 … 55, 50 | * Reading this from left to right shows: 00, 01, 10, 02, 20 … 41, 15 … 33, 34 … 55, 50 | ||
| + | * this 50 at the end is comprised of the last 5 and the first 0. | ||
| </ | </ | ||
chess/programming/de_bruijn_sequence/about_de_bruijn_sequences.1635430525.txt.gz · Last modified: 2021/10/28 14:15 by peter