Rule:Ariadne

From LifeWiki
Revision as of 19:41, 19 December 2019 by Dvgrn (talk | contribs) (Rule 'ariadne' from auto-import project)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

@RULE ariadne

https://conwaylife.com/forums/viewtopic.php?p=55964#p55964

Fun with cellular automata, mino-tours Naszvadi, Peter, 2018

@TREE

num_states=8 num_neighbors=4 num_nodes=72 1 0 1 3 4 4 1 3 3 1 0 5 3 4 4 1 3 3 1 0 5 3 2 4 1 3 3 2 0 0 1 0 0 0 2 0 2 1 1 1 1 1 1 2 1 2 2 2 2 2 2 2 2 2 1 0 1 3 4 2 1 3 3 2 0 0 1 0 0 6 2 0 3 3 3 4 3 3 3 5 7 1 0 5 3 4 2 1 3 3 2 0 0 9 0 0 0 2 0 3 3 10 4 3 3 10 5 7 2 1 9 1 1 1 9 2 1 2 1 1 1 1 1 9 2 1 3 4 12 4 4 4 12 5 13 2 0 0 1 0 0 0 2 6 2 0 0 9 0 0 0 2 6 2 1 1 1 1 1 1 2 9 1 0 5 3 2 2 1 3 3 2 2 2 2 2 2 2 2 18 2 0 0 1 0 0 6 2 6 3 15 16 17 15 15 16 19 20 2 2 2 2 2 2 18 2 2 3 5 5 5 5 5 5 5 22 4 8 11 14 8 8 21 23 8 3 3 10 12 3 3 10 5 7 1 0 5 3 4 6 1 3 3 2 0 0 26 0 0 0 2 0 2 9 26 9 9 9 26 18 9 3 3 27 28 3 3 27 5 7 2 1 26 9 1 1 26 2 1 2 2 18 2 2 2 18 2 2 3 12 30 12 12 12 30 31 12 2 0 0 26 0 0 0 2 6 3 15 33 28 15 15 33 19 20 2 2 2 18 2 2 2 2 2 3 5 35 31 5 5 35 5 22 4 25 29 32 25 25 34 36 25 3 4 4 4 4 4 4 5 13 3 12 28 12 12 12 28 31 12 1 0 5 3 4 7 1 3 3 2 1 1 1 1 40 1 2 1 3 4 4 4 4 41 4 5 13 2 1 9 1 1 1 9 2 9 2 2 18 2 2 2 18 2 18 3 43 28 43 43 43 28 44 43 4 38 39 14 38 42 45 23 38 3 4 12 4 4 41 12 5 13 1 0 5 3 2 7 1 3 3 2 0 0 40 0 0 0 48 0 2 2 2 2 2 48 2 2 2 3 3 3 41 3 49 3 50 7 3 5 5 5 5 50 5 5 22 4 8 11 47 8 51 21 52 8 2 6 6 9 6 6 6 18 6 2 9 9 9 9 9 9 18 9 2 18 18 18 18 18 18 18 18 3 54 54 55 54 54 54 56 54 4 25 29 32 25 25 34 36 57 3 5 35 5 5 5 35 5 22 3 5 31 5 5 5 31 5 22 2 2 2 18 2 2 2 2 18 2 2 2 2 2 2 18 2 18 3 19 61 19 19 19 61 19 62 4 23 59 60 23 52 63 23 23 3 3 3 4 3 3 54 5 7 3 3 10 4 3 3 54 5 7 3 4 12 4 4 4 55 5 13 3 15 16 17 15 15 54 19 20 3 5 5 5 5 5 56 5 22 4 65 66 67 65 65 68 69 65 5 24 37 46 24 53 58 64 70

@TABLE

  1. Format: C,N,E,S,W,C'

n_states:8 neighborhood:vonNeumann symmetries:rotate4 var a={0,1,2,3,4,5,6,7} var b={0,1,2,3,4,5,6,7} var c={0,1,2,3,4,5,6,7} var d={0,1,2,3,4,5,6,7} var f={1,5} var g={1,5} var h={1,5}

  1. 1 = wall
  2. 2 = wanderer
  3. 3 = wanderer's last place
  4. 4 = path
  5. 5 = touched wall
  6. 6 = wanderer in dead end
  7. 7 = wanderer in crossroads
  1. dead end

4,2,f,g,h,6 3,6,a,b,c,2

  1. path change

4,2,4,4,4,7 4,6,4,4,4,7 4,2,f,a,g,2 4,2,a,f,g,2 4,5,a,b,7,2 3,6,4,4,4,7

  1. wall

5,a,b,c,d,1 1,2,a,b,c,5 1,6,a,b,c,5

  1. trail

3,a,b,c,d,4

  1. wanderer leaves

2,a,b,c,d,3 6,a,b,c,d,3 7,a,b,c,d,3

  1. other transitions

0,a,b,c,d,0 1,a,b,c,d,1 2,a,b,c,d,2 3,a,b,c,d,3 4,a,b,c,d,4 5,a,b,c,d,5 6,a,b,c,d,6 7,a,b,c,d,7

@COLORS

1 255 255 255 2 192 192 192 3 64 255 64 4 255 64 64 5 128 0 255 6 188 188 188 7 255 255 64