|
|
EXAMPLE
| A meander can be specified by marking 2n equally spaced points along a line and recording the order in which the meander visits the points.
For n = 2, 4, 6, 8 the solutions are as follows:
n=2: 1 2
n=4: 1 2 3 4
n=6: 1 2 3 4 5 6, 1 2 3 6 5 4, 1 2 5 4 3 6, 1 4 3 2 5 6
n=8: 1 2 3 4 5 6 7 8, 1 2 3 4 5 8 7 6, 1 2 3 4 7 6 5 8, 1 2 7 6 3 4 5 8, 1 2 3 6 7 8 5 4, 1 2 3 6 5 4 7 8,
n=8 (cont.): 1 2 5 4 3 6 7 8, 1 2 3 8 7 6 5 4, 1 2 5 4 3 8 7 6, 1 2 7 6 5 4 3 8, 1 2 3 8 5 6 7 4, 1 2 3 8 7 4 5 6, 1 2 5 6 7 4 3 8,
n=8 (cont.): 1 2 7 4 5 6 3 8, 1 4 3 2 5 6 7 8, 1 4 5 6 3 2 7 8, 1 4 3 2 5 8 7 6, 1 4 3 2 7 6 5 8, 1 6 5 4 3 2 7 8, 1 6 5 2 3 4 7 8, 1 6 3 4 5 2 7 8,
|
