Radran
Period
Modern
Category
Experimental, Graph theory
Description
Radran is a graph theory game that uses a regular graph mechanism. A regular graph is a graph where each vertex has the same number of neighbours; i.e. every vertex has the same degree. Radran can be played on any undirected and edgeweighted graph. It can be played with two or more player.
Rules
The graph is initially empty. Players alternate turns colouring an uncoloured edge between two of the vertices. Both players share a common colour for this gameplay. Radran is a scorebased game. At each turn, a player gets a score, which is equal to the cost of his last coloured edge. The game ends when the coloured graph is regular. The player with the highest score wins.
Author
Tahmina Begum
Creation date
20200701
Ludeme Description
Radran.lud
Concepts
Browse all concepts for Radran here.
Similar Games
Identifiers
DLP.Games.589
