apgsearch - haul requests

[Disaster16439]

Apgsearch B34q5q/S23-k/C1 to at least 500 million. Or, apgsearch B34q/S23-k/D2_+1(D4_+1, D4_+4 and D8_1 are okay too). B34q5q/S23-k/C1 is the priority(I prefer using my golly to search higher symmetries)
My 189th post! 189=3^3x7

[b-engine]

APGsearch both R2,C0,S4-6,B5-6,N# and R3,C0,S5-9,B7-9,N# in any symmetry and amount you like. If APGsearch doesn't works with these rulestring, try use the rulefile below.

Code: Select all

@RULE Hash1

@COLORS
0 0 0 0
1 255 255 255

# This ruletable is automatically generated by CAViewer
# Note that is ruletable may not work properly in Golly as it is meant to be run by lifelib.
# If this ruletable operates in with a range 1 neighbourhood, switch neighbourhood:... with neighbourhood:Moore or any other appropriate neighbourhood to run it in Golly

@TABLE
n_states:2
neighborhood:[(0, 0), (-2, -1), (-2, 1), (-1, -2), (-1, -1), (-1, 0), (-1, 1), (-1, 2), (0, -1), (0, 1), (1, -2), (1, -1), (1, 0), (1, 1), (1, 2), (2, -1), (2, 1), (0, 0)]
symmetries:permute

var _any.0.0 = {0, 1}
var _any.1.0 = _any.0.0
var _any.2.0 = _any.0.0
var _any.3.0 = _any.0.0
var _any.4.0 = _any.0.0
var _any.5.0 = _any.0.0
var _any.6.0 = _any.0.0
var _any.7.0 = _any.0.0
var _any.8.0 = _any.0.0
var _any.9.0 = _any.0.0
var _any.10.0 = _any.0.0
var _any.11.0 = _any.0.0
var _any.12.0 = _any.0.0
var _any.13.0 = _any.0.0
var _any.14.0 = _any.0.0
var _any.15.0 = _any.0.0

0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
1, _any.0.0, _any.1.0, _any.2.0, _any.3.0, _any.4.0, _any.5.0, _any.6.0, _any.7.0, _any.8.0, _any.9.0, _any.10.0, _any.11.0, _any.12.0, _any.13.0, _any.14.0, _any.15.0, 0

Code: Select all

@RULE Hash2

@COLORS
0 0 0 0
1 255 255 255

# This ruletable is automatically generated by CAViewer
# Note that is ruletable may not work properly in Golly as it is meant to be run by lifelib.
# If this ruletable operates in with a range 1 neighbourhood, switch neighbourhood:... with neighbourhood:Moore or any other appropriate neighbourhood to run it in Golly

@TREE
num_states=2
num_neighbors=[(-3, -1), (-3, 1), (-2, -1), (-2, 1), (-1, -3), (-1, -2), (-1, -1), (-1, 0), (-1, 1), (-1, 2), (-1, 3), (0, -1), (0, 1), (1, -3), (1, -2), (1, -1), (1, 0), (1, 1), (1, 2), (1, 3), (2, -1), (2, 1), (3, -1), (3, 1), (0, 0), (0, 0)]
num_nodes=201
1 0 0 
2 0 0 
3 1 1 
4 2 2 
5 3 3 
1 0 1 
2 0 5 
3 1 6 
4 2 7 
5 3 8 
6 4 9 
2 5 5 
3 6 11 
4 7 12 
5 8 13 
6 9 14 
7 10 15 
1 1 1 
2 5 17 
3 11 18 
4 12 19 
5 13 20 
6 14 21 
7 15 22 
8 16 23 
2 17 17 
3 18 25 
4 19 26 
5 20 27 
6 21 28 
7 22 29 
8 23 30 
9 24 31 
3 25 25 
4 26 33 
5 27 34 
6 28 35 
7 29 36 
8 30 37 
9 31 38 
10 32 39 
2 17 0 
3 25 41 
4 33 42 
5 34 43 
6 35 44 
7 36 45 
8 37 46 
9 38 47 
10 39 48 
11 40 49 
3 41 1 
4 42 51 
5 43 52 
6 44 53 
7 45 54 
8 46 55 
9 47 56 
10 48 57 
11 49 58 
12 50 59 
4 51 2 
5 52 61 
6 53 62 
7 54 63 
8 55 64 
9 56 65 
10 57 66 
11 58 67 
12 59 68 
13 60 69 
5 61 3 
6 62 71 
7 63 72 
8 64 73 
9 65 74 
10 66 75 
11 67 76 
12 68 77 
13 69 78 
14 70 79 
6 71 4 
7 72 81 
8 73 82 
9 74 83 
10 75 84 
11 76 85 
12 77 86 
13 78 87 
14 79 88 
15 80 89 
6 4 4 
7 81 91 
8 82 92 
9 83 93 
10 84 94 
11 85 95 
12 86 96 
13 87 97 
14 88 98 
15 89 99 
16 90 100 
7 91 91 
8 92 102 
9 93 103 
10 94 104 
11 95 105 
12 96 106 
13 97 107 
14 98 108 
15 99 109 
16 100 110 
17 101 111 
8 102 102 
9 103 113 
10 104 114 
11 105 115 
12 106 116 
13 107 117 
14 108 118 
15 109 119 
16 110 120 
17 111 121 
18 112 122 
9 113 113 
10 114 124 
11 115 125 
12 116 126 
13 117 127 
14 118 128 
15 119 129 
16 120 130 
17 121 131 
18 122 132 
19 123 133 
10 124 124 
11 125 135 
12 126 136 
13 127 137 
14 128 138 
15 129 139 
16 130 140 
17 131 141 
18 132 142 
19 133 143 
20 134 144 
11 135 135 
12 136 146 
13 137 147 
14 138 148 
15 139 149 
16 140 150 
17 141 151 
18 142 152 
19 143 153 
20 144 154 
21 145 155 
12 146 146 
13 147 157 
14 148 158 
15 149 159 
16 150 160 
17 151 161 
18 152 162 
19 153 163 
20 154 164 
21 155 165 
22 156 166 
13 157 157 
14 158 168 
15 159 169 
16 160 170 
17 161 171 
18 162 172 
19 163 173 
20 164 174 
21 165 175 
22 166 176 
23 167 177 
14 168 168 
15 169 179 
16 170 180 
17 171 181 
18 172 182 
19 173 183 
20 174 184 
21 175 185 
22 176 186 
23 177 187 
24 178 188 
15 179 179 
16 180 190 
17 181 191 
18 182 192 
19 183 193 
20 184 194 
21 185 195 
22 186 196 
23 187 197 
24 188 198 
25 189 199 

[Haycat2009]

Apgsearch G4_1, G4_4, H8_1 and H8_4 in Grounded Life

[b-engine]

Apgsearch Ignorance in C1 and another symmetry using the ruletable below:

Code: Select all

@RULE Ignorance
@TABLE
n_states:3
neighborhood:Moore
symmetries:permute
var a = {0,1,2}
var a1 = a
var a2 = a
var a3 = a
var a4 = a
var a5 = a
var a6 = a
var a7 = a
var a8 = a
var b = {0,2}
var b1 = b
var b2 = b
var b3 = b
var b4 = b
var c = {0,1}
var c1 = c
var c2 = c
var c3 = c
var c4 = c
0,1,1,1,2,2,2,0,0,0
0,1,1,1,b,b1,b2,b3,b4,1
0,2,2,2,c,c1,c2,c3,c4,2
1,1,1,a,b,b1,b2,b3,b4,1
2,2,2,a,c,c1,c2,c3,c4,2
a,a1,a2,a3,a4,a5,a6,a7,a8,0
@COLORS
1 255 150 0
2 0 92 255

If apgsearch supports 3-state OT rulestring, try to convert it to the rulestring.

[confocaloid]

apgsearch wishlist, Life-like cellular automata:

• b36s23/C1 until all 111 12-bit still lives have an occurrence
• b38s238/C1 until all 240 13-bitters have an occurrence
• b3s238/C1 until all 121 12-bitters and all 240 13-bitters have an occurrence
• b357s238/C1, b358s238/C1, b35s238/C1, b357s23/C1, b358s23/C1 until all 52 12-bitters have an occurrence

apgsearch wishlist, other cellular automata:

• The closest non-totalistic rules from B3/S23, e.g. B3/S234c, B3/S234e, B34c/S23, B34e/S23.
  Let's see how they are different from B3/S23.

• b3s236i/C1, b3s234c6i/C1 for the same reasons
• b3s236e/C1 because switch engine (see e.g. ror_stdin_test/xq96)