Algo Arena· Plarena — escapes from brute force

Every interesting problem can, in principle, be solved by brute-force search. This course is a sequence of increasingly clever escapes from brute force — each escape works only when the problem has the right structure, and our job is to (1) model the problem, (2) recognize the structure, (3) verify the escape actually works.
One 12×12 map. One robot. Nine rooms, each one full P→F→S→V→L ↻ loop. The Scoreboard grows all semester — its final row is red.
P
F
S
V
L
↻
Problem · Formulate · Solve · Verify · Limits · ↻ escape — the limits become the next problem
speed
—
Scoreboard — grows all semester
instancealgorithmopsanswer
rows appear as you run things — ops are exact, replayable counts. Session-local by design: a reload clears it, and every row is one click to recreate.
Campus map (Map-1)

Work in progress

Plarena is under active development — rough edges, bugs and placeholder content are all expected. Found something broken, confusing or missing? Have an idea? Please tell Xian Su at feedback@plarena.app. Every piece of feedback makes the next version better. Thank you.