mirrors/hyperrogue
1
0
Fork 0
mirror of https://github.com/zenorogue/hyperrogue.git synced 2024-12-25 17:40:36 +00:00
Code Issues Releases Wiki Activity

more levels of long_transformations

Browse Source
This commit is contained in:
Zeno Rogue 2023-03-28 14:24:33 +02:00
parent 014f88132a
commit 3baf09be25
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
aperiodic-hat.cpp
View File

@ -511,7 +511,7 @@ struct hrmap_hat : hrmap {
lt[0][0].set(Id); lt[0][0].set(Id);
lt[0][1].set(Id); lt[0][1].set(Id);
lt.resize(20, lt[0]); lt.resize(30, lt[0]);
while(true) { while(true) {
int chg = 0; int chg = 0;
@ -533,7 +533,7 @@ struct hrmap_hat : hrmap {
products_equal(lt[0][b.id0+1], adj(b.id0==0, fix(b.edge0), b.id1==0, fix(b.edge1)), lt[1][b.master_connection+1], lt[0][b.id1+1]); products_equal(lt[0][b.id0+1], adj(b.id0==0, fix(b.edge0), b.id1==0, fix(b.edge1)), lt[1][b.master_connection+1], lt[0][b.id1+1]);
} }
for(int k=1; k<19; k++) for(auto& b: rules_recursive) { for(int k=1; k<29; k++) for(auto& b: rules_recursive) {
products_equal(lt[k+1][b.id0+1], lt[k][b.child+1], lt[k+1][b.parent+1], lt[k+1][b.id1+1]); products_equal(lt[k+1][b.id0+1], lt[k][b.child+1], lt[k+1][b.parent+1], lt[k+1][b.id1+1]);
} }