Convert a strategic network into a weighted graph and find a route that minimizes cost. The story is traditional; the graph algorithm is modern.
Your objectiveBuild a valid route and then minimize its total weighted cost.
How to playModel → execute → test → audit → optimize. A correct result can still be inefficient.
Historical lensArthaśāstra strategy and information networks are the narrative lens; shortest-path graph theory is the modern formalism.
Route cost 0Score 0
Click nodes to build a route from A to F. You may revisit a node, but extra travel increases cost.
Select A, then build a route to F.
Historical lens: Arthaśāstra strategy supplies a systems-and-network scenario; graph theory and shortest-path algorithms are modern mathematical machinery applied to that scenario.
Source and scope: Kautilya's Arthaśāstra contains extensive strategic thinking about state, information, movement and networks. Modern graph theory is not claimed as an ancient Indian discipline here; the game converts a strategic setting into a formal graph problem.
