Table of Contents
1 Chasing Snakes in N-space Cubes
2 Overview
3 What is an N-space Snake?
4 Snake Defined
5 The Special Rule
6 An Invalid Snake
7 Adjacent Points
8 A Mini Snake
9 A Valid 3-space Great Snake
10 Find a 4-space Great Snake
11 An invalid 4-space snake
12 Invalid: Here's Why
13 Another invalid 4-space snake
14 Twice Invalid
15 Is this a valid 4-space Great Snake?
16 A valid 4-space Great Snake
17 Another 4-space Snake
18 Now, for a harder task
19 Find a 4-space snake
20 Here's a 5-space Snake
21 Naming Snakes
22 Named with the binary order
23 Start anywhere
24 Opposite Directions
25 Many binary names: One snake
26 Other rotations
27 A 'Moving' Snake
28 Horizontal Rotations
29 Rotating the columns
30 Interchanging the columns
31 Other, better naming schemes
32 Linesets in a cube
33 The Column number naming scheme
34 It's better, more efficient
35 Unexpected Structure
36 Two names for a 5-space cube
37 More Unexpected Structure!
38 A Clue to Creating Snakes?
39 How big is Big?
40 This Big
41 Cataloging all the snakes
42 How many Unique snakes are there?
43 First, we have to find them all
44 Brute Force and Ignorance (BFI)
45 Starting at 0000
46 Rule Violation
47 Continue Choosing Points
48 Tailwagger finds a snake
49 Backtracking
50 Throwing out the duplicates
51 Vertical Shift duplicates
52 A right shifted duplicate
53 Are these the same snakes?/A>
54 Opposite Direction Vertical Shifts
55 How about these snakes?
56 Shifted, intermixed rotation
57 A third naming convention
58 A partial naming trick
59 They are the same snakes
60 Unmasking the unique snakes
61 The unique snake list
62 7-space: A very large problem
53 This is the conclusion?
|
Author: Dennis Clark
Email:
(Dennis Clark)
Home Page: http://www.howtoadapt.com/dnclark
Download presentation source
|