Colour Exploration Workbench

Click on empty space to add a vertex.

speed

Ledger

#	at	reads	does	may serve	served

Algorithm

Write the rule as code: a function body receiving the row and returning the action. It is compiled into a table for every row up to the graph’s largest degree, so the engine and the exact game use exactly what you wrote. Rows in the table below still win over it.

template

Undefined rows

answered by

Rows you define below always win over the default. With “nothing”, the first undefined row the agent reads stops the play and asks you for its action, so a rule can be built while playing.

Defined rows

rows starting with this text; at most 2000 shown

paint target

row	bag	paint	target

Import / export

One row paint>target per line, the engine’s rule_final.txt format; lines starting with # are ignored.

All adversarial executions

The exact game enumerates every position the adversary can reach under the rule. “Explores” means no adversarial execution leaves a vertex unvisited; “fails” comes with one trapping execution you can replay.

position cap

Quick adversary walks

random walks