Graph entropy ↔ network coding ↔ guessing games
Interactive visualisation of gluing/splitting multiple-unicast networks and computing fixed points / guessing numbers on the glued graph.
Six interactive tools linked from the main webpage.
New: Impartial 4×4 nimber explorer and maximal Condorcet domain explorer (n=4,5).
Interactive visualisation of gluing/splitting multiple-unicast networks and computing fixed points / guessing numbers on the glued graph.
Run hat simulations on K5 (sum strategy) and C5 (pairing strategy for square alphabets), inspect a single run, and estimate success probability over alphabet size s.
Explore a Markov-coin parameter space (McDonald-shaped region) where pairwise “pattern appears first” comparisons become non-transitive, and run Monte Carlo simulations.
Play NIM against a near-perfect teacher (perfect with probability 1−ε, random with probability ε), inspect the nim-sum (xor), and connect the solution to abstract mathematical structure rather than raw board appearance.
Explore all 65,536 positions of a 4x4 impartial removal game, query the Grundy value of any position, inspect nimbers of every legal move, and display all positions with maximal nimber.
Browse maximal unitary Condorcet domains as adjacent-swap graphs, with structural graph feedback and bundled MUCD data files for n=4 and n=5.