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

rulegen:: w_bfs option

Browse Source
This commit is contained in:
Zeno Rogue 2021-08-22 19:42:07 +02:00
parent 320ff44ef3
commit 59aed89f96
1 changed files with 22 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
rulegen.cpp
View File

@ -74,6 +74,7 @@ static const flagtype w_parent_never = Flag(13); /*< never consider the full par
static const flagtype w_always_clean = Flag(14); /*< restart following phases after any distance errors */ static const flagtype w_always_clean = Flag(14); /*< restart following phases after any distance errors */
static const flagtype w_single_origin = Flag(15); /*< consider only one origin */ static const flagtype w_single_origin = Flag(15); /*< consider only one origin */
static const flagtype w_slow_side = Flag(16); /*< do not try get_side optimization */ static const flagtype w_slow_side = Flag(16); /*< do not try get_side optimization */
static const flagtype w_bfs = Flag(17); /*< compute distances using BFS */
#endif #endif
EX flagtype flags = 0; EX flagtype flags = 0;
@ -482,7 +483,25 @@ EX void remove_parentdir(tcell *c) {
} }
} }
queue<tcell*> bfs_queue;
void fix_distances(tcell *c) { void fix_distances(tcell *c) {
if(flags & w_bfs) while(true) {
ufindc(c);
if(c->dist != MYSTERY) return;
if(tcellcount >= max_tcellcount) throw rulegen_surrender("max_tcellcount exceeded");
if(bfs_queue.empty()) throw rulegen_failure("empty bfs queue");
auto c1 = bfs_queue.front();
ufindc(c1);
bfs_queue.pop();
for(int i=0; i<c1->type; i++) {
tcell *c2 = c1->cmove(i);
if(c2->dist == MYSTERY) {
c2->dist = c1->dist + 1;
bfs_queue.push(c2);
}
}
}
c->distance_fixed = true; c->distance_fixed = true;
vector<tcell*> q = {c}; vector<tcell*> q = {c};
@ -1631,6 +1650,9 @@ EX void generate_rules() {
t_origin.push_back(c); t_origin.push_back(c);
} }
bfs_queue = {};
if(flags & w_bfs) for(auto c: t_origin) bfs_queue.push(c);
try_count = 0; try_count = 0;
important = t_origin; important = t_origin;