mirrors/hyperrogue
1
0
Fork 0
mirror of https://github.com/zenorogue/hyperrogue.git synced 2025-10-31 14:02:59 +00:00
Code Issues Releases Wiki Activity

rulegen3:: more careful when adding to important

Browse Source
This commit is contained in:
Zeno Rogue
2022-08-07 01:47:52 +02:00
parent 4b4103f667
commit c8f3dc827e
1 changed files with 15 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
rulegen3.cpp
View File

@@ -195,6 +195,9 @@ int last_qroad;
vector<vector<pair<int,int>>> possible_parents; vector<vector<pair<int,int>>> possible_parents;
set<tcell*> imp_as_set;
int impcount;
struct vcell { struct vcell {
int tid; int tid;
vector<int> adj; vector<int> adj;
@@ -218,6 +221,14 @@ int get_abs_rule(int tid, int j) {
return ts.rules[j1]; return ts.rules[j1];
} }
void be_important(tcell *c) {
if(imp_as_set.count(c)) {
return;
}
important.push_back(c);
imp_as_set.insert(c);
}
void build(vstate& vs, vector<tcell*>& places, int where, int where_last, tcell *g) { void build(vstate& vs, vector<tcell*>& places, int where, int where_last, tcell *g) {
places[where] = g; places[where] = g;
// twalker wh = g; // twalker wh = g;
@@ -231,8 +242,10 @@ void build(vstate& vs, vector<tcell*>& places, int where, int where_last, tcell
twalker wh1 = g1; twalker wh1 = g1;
auto ts = get_treestate_id(wh1).second; auto ts = get_treestate_id(wh1).second;
if(ts != rule) { if(ts != rule) {
important.push_back(g); be_important(g);
important.push_back(g1); // be_important(treestates[ts0.second].giver.at);
be_important(g1);
// be_important(treestates[ts].giver.at);
continue; continue;
} }
build(vs, places, c.adj[i], where, g1); build(vs, places, c.adj[i], where, g1);