Implementing Subspace Anomalies in Hunt the Wumpus
summary
Grid-based Hunt the Wumpus becomes a mutable graph: a 3x6 polar grid and toroidal wrap prove that rows and columns can be replaced by directed edges and alternate neighborhoods (von Neumann vs Moore). The implementation pushes sets of edges onto an undo stack and stores a lambda as the undo action so topology changes are reversible. Examples include one-way conduits and a trap-like well where edges become incoming-only; the proof-of-concept runs and rolls back cleanly.
AI-written summary · about
related talks
26mTwisty Little Passages
44mCellPond: Spatial programming without escape
12mAperiodic Tiling
27mReclaiming the Unexplored in Hybrid Visual Programming
25mGraph Theory and Games: A Case Study on New York Times Connections
31mAbstract nonsense
16mRats Of The Maze
20mSeek, and you shall find your way to fun!