Random Walks on Graphs with Adversarial Nodes

An interactive playground for the Duplicate-If-Late and Create-If-Late algorithms.

Website Credits: Dr. Enirehtak and Dr. Suoitcnubmar

Quick start: defaults are pre-filled — click Randomize board for a fresh setup, then Simulate.
1. Graph
2. Pac-Men (adversaries)
3. Algorithm
4. Time steps
Advanced settings
Optional. Max 100 nodes. Overrides topology & N above.
Export
Graph file (importable here or in NetworkX / Gephi / yEd):
Walker-count plot — image (fixed) or raw data (re-plot in your tool of choice):
Manim render package — produces the publication-quality video locally:

Graph Preview

Live Preview · Not the Manim render ⓘ

Walker count vs. time

Run a simulation to see the walker-count trajectory.