HuntingBot

Feature request

5

@AlephAlpha 其实我最近想到一个东西，应该不难加，而且能把之前大多数问题都包括进去。 可以在 save.json 里面指定一些逻辑表达式，比如 `(![0,0,0]&[0,0,1]&[0,0,2]&[0,0,3])&(!(![0,0,0]&![0,0,1]&![0,0,2]&![0,0,3]))`，然后搜的时候如果不满足这些逻辑表达式就回溯。

@AlephAlpha 现在网页版的保存进度方式是手动点击按钮下载到本地。 能不能像猫国建设者那样，每隔几十秒钟把存档保存到浏览器缓存里面，这个实现起来会有困难吗。 （其实最好能做一个存档管理器）

有时候搜索结果里会出现问号

18

比如： ``` {"config":{"width":9,"height":50,"period":3,"dx":0,"dy":0,"transform":"Id","symmetry":"D2Col","search_order":null,"new_state":"Random","max_cell_count":null,"non_empty_front":true,"reduce_max":false,"rule_string":"B2n3/S23-q","diagonal_width":null},"conflicts":3425115,"set_stack":[{"coord":[0,0,0],"state":0,"reason":"Deduce"}, {"coord":[0,0,1],"state":0,"reason":"Deduce"}, {"coord":[0,0,2],"state":0,"reason":"Deduce"}, {"coord":[1,0,0],"state":0,"reason":"Deduce"}, {"coord":[1,0,1],"state":0,"reason":"Deduce"}, {"coord":[1,0,2],"state":0,"reason":"Deduce"}, {"coord":[2,0,0],"state":0,"reason":"Deduce"}, {"coord":[2,0,1],"state":0,"reason":"Deduce"}, {"coord":[2,0,2],"state":0,"reason":"Deduce"}, {"coord":[3,0,0],"state":0,"reason":"Deduce"}, {"coord":[3,0,1],"state":0,"reason":"Deduce"}, {"coord":[3,0,2],"state":0,"reason":"Deduce"}, {"coord":[4,0,0],"state":1,"reason":"Deduce"}, {"coord":[4,0,1],"state":0,"reason":"Deduce"}, {"coord":[4,0,2],"state":0,"reason":"Deduce"}, {"coord":[5,0,0],"state":0,"reason":"Deduce"}, {"coord":[5,0,1],"state":0,"reason":"Deduce"}, {"coord":[5,0,2],"state":0,"reason":"Deduce"}, {"coord":[6,0,0],"state":0,"reason":"Deduce"}, {"coord":[6,0,1],"state":0,"reason":"Deduce"}, {"coord":[6,0,2],"state":0,"reason":"Deduce"}, {"coord":[7,0,0],"state":0,"reason":"Deduce"}, {"coord":[7,0,1],"state":0,"reason":"Deduce"}, {"coord":[7,0,2],"state":0,"reason":"Deduce"}, {"coord":[8,0,0],"state":0,"reason":"Deduce"}, {"coord":[8,0,1],"state":0,"reason":"Deduce"}, {"coord":[8,0,2],"state":0,"reason":"Deduce"}],"check_index":0,"search_index":0} ```...

@AlephAlpha 如题，能不能增加一些不考虑的细胞，也就是说，它们能作用于其他细胞，但是对于它们本身能否回到初始状态不关心。感觉实现起来可能应该不会很难（？） 这个可以作为搜索顺序的替代品。

【搜索顺序】

3

@AlephAlpha 网页版的搜索顺序如果想要自己指定的话是不是仍然可以改 save.json 的 search order 啊？只是没想到好的输入方式，还是说 FromVec 干脆就是命令行版的特有功能？ 另外，修改 check_index 是不是可以使 rlifesrc 忽略前面的一些细胞状态是否正确？

另外几个优化

10

@AlephAlpha 1. 如果空行的数量超过period就直接出结果 2. 如果当前已经是结果就不要搜了

更多需要行的优化

6

慢也没事，总比把同一个分支运行很多次好很多。（当然应该做成可选的。） 每搜一行就在散列表中查询它的转子，如果没有就继续搜索并把它的转子记录到散列表中，如果有就回溯。 @AlephAlpha

关于改进算法

5

第一，应该有一个选项，对于 gutter-symmetric 的规则（也就是没有 B2i，B4i，B4c，B6i），打开之后，搜到某一行（按行搜时）或某一列（按列搜时）在所有代都为死时停止搜索（因为可以用它自己稳定那一行）。除了震荡子，搜索方向与移动方向相互正交的飞船也可以用这个选项（这样搜 Spider 之类的就很容易） 第二，应该有另一个选项，对于 Choice of state for unknown cells 为 Dead 的搜索，结果的 hash 会被记录在一个表里（不包括离最近的活细胞距离超过2的部分），然后（在搜索过程中）剪掉所有符合表中任意一条记录的分支。不只要用 hash，可能还要用到别的高科技（因为要检测是否“符合表中任意一条记录”） 第三，应该还有一个选项（好吧，这个算是 Feature request），要求第一个 strictly-volatile 或者不对称等等的行/列/行加列出现在前 N 行，如果当前假定的前 N 行/列/行加列都没有 strictly-volatile 或者不对称等等的行/列/行加列，则放弃。...

可喜可贺

2

@AlephAlpha 今天 rlifesrc（在一些人工的帮助下）在 LeapLife 中找到了一个 p5 的 domino sparker。 ``` x = 16, y = 83, rule = B2n3/S23-q 4b2ob2ob2o$bobo2bo2bo2bobo$o2bo8bo2bo$2o4b4o4b2o3$5bob2obo$5b2o2b2o2$ 2o2bo6bo2b2o$o2b4o2b4o2bo$b2o2bo4bo2b2o$3b2o6b2o$3bo8bo$2obob2o2b2obob 2o$2obo8bob2o$3bo2bo2bo2bo$3ob2o4b2ob3o$o4bo4bo4bo$bob2o6b2obo$2obob6o bob2o$4b2o4b2o$2obo8bob2o$bob2obo2bob2obo$bo2bo2b2o2bo2bo$2b3o6b3o2$6o 4b6o$o14bo$bob3o4b3obo$2obo2b4o2bob2o$6b4o$5b6o$2o2bobo2bobo2b2o$o14bo $b4o6b4o2$b3ob2o2b2ob3o$obo3b4o3bobo$o3b2o4b2o3bo$b3obo4bob3o2$b3obo4b ob3o$o3b2o4b2o3bo$obo3b4o3bobo$b3ob2o2b2ob3o2$b4o6b4o$o14bo$2o2bobo2bo bo2b2o$5b6o$6b4o$2obo2b4o2bob2o$bob3o4b3obo$o14bo$6o4b6o2$2b3o6b3o$bo 2bo2b2o2bo2bo$bob2obo2bob2obo$2obo8bob2o$4b2o4b2o$2obob6obob2o$bob2o6b 2obo$o4bo4bo4bo$3ob2o4b2ob3o$3bo2bo2bo2bo$2obo8bob2o$2obob2o2b2obob2o$ 3bo8bo$3b2o6b2o$b2o2bo4bo2b2o$o2b4o2b4o2bo$2o2bo6bo2b2o2$5b2o2b2o$5bob...

我真是无语了

4

{"config":{"width":6,"height":99,"period":5,"dx":0,"dy":0,"transform":"Id","symmetry":"D2Col","search_order":null,"new_state":"ChooseAlive","max_cell_count":null,"non_empty_front":true,"reduce_max":false,"rule_string":"B2n3/S23-q","diagonal_width":null,"skip_level":"SkipSubperiodSpaceship"},"conflicts":349090,"set_stack":[{"coord":[0,0,0],"state":0,"reason":"Deduce"}, {"coord":[0,0,1],"state":0,"reason":"Deduce"}, {"coord":[0,0,2],"state":0,"reason":"Deduce"}, {"coord":[0,0,3],"state":0,"reason":"Deduce"}, {"coord":[0,0,4],"state":0,"reason":"Deduce"}, {"coord":[1,0,0],"state":0,"reason":"Deduce"}, {"coord":[1,0,1],"state":0,"reason":"Deduce"}, {"coord":[1,0,2],"state":0,"reason":"Deduce"}, {"coord":[1,0,3],"state":0,"reason":"Deduce"}, {"coord":[1,0,4],"state":0,"reason":"Deduce"}, {"coord":[2,0,0],"state":1,"reason":"Deduce"}, {"coord":[2,0,1],"state":0,"reason":"Deduce"}, {"coord":[2,0,2],"state":0,"reason":"Deduce"}, {"coord":[2,0,3],"state":0,"reason":"Deduce"}, {"coord":[2,0,4],"state":0,"reason":"Deduce"}, {"coord":[3,0,0],"state":1,"reason":"Deduce"}, {"coord":[3,0,1],"state":0,"reason":"Deduce"}, {"coord":[3,0,2],"state":0,"reason":"Deduce"}, {"coord":[3,0,3],"state":0,"reason":"Deduce"}, {"coord":[3,0,4],"state":0,"reason":"Deduce"}, {"coord":[4,0,0],"state":0,"reason":"Deduce"}, {"coord":[4,0,1],"state":0,"reason":"Deduce"}, {"coord":[4,0,2],"state":0,"reason":"Deduce"}, {"coord":[4,0,3],"state":0,"reason":"Deduce"}, {"coord":[4,0,4],"state":0,"reason":"Deduce"}, {"coord":[5,0,0],"state":0,"reason":"Deduce"}, {"coord":[5,0,1],"state":0,"reason":"Deduce"}, {"coord":[5,0,2],"state":0,"reason":"Deduce"}, {"coord":[5,0,3],"state":0,"reason":"Deduce"}, {"coord":[5,0,4],"state":0,"reason":"Deduce"}],"check_index":2848}...