DisPath
Leaderboard
Period
Modern
Category
Math, Graph
Description
DisPath is a 2player graph theory game, which can be played on vertices or edges of any graph. The aim of the game is to make more disjoint paths. Every disjoint path needs to be fully disconnected from any other friendly path. The length of the path can be any integer (in this game, we have used k = 3). The motivation comes from the Disjoint path problem in graph theory.
Rules
Each turn, a player selects a graph element (vertex or edge) to create a disjoint path with size k. When a player successfully makes a path of a specific size, he gets a point. The player with the highest score wins the game.
Author
Tahmina Begum
Creation date
20200330
Ludeme Description
DisPath.lud
Concepts
Browse all concepts for DisPath here.
Identifiers
DLP.Games.548
