background Ludii Portal
Home of the Ludii General Game System

   

Home Games Forum Downloads References Concepts Contribute Tutorials Tournaments World Map Ludemes About


 
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 edge-weighted 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 score-based 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

2020-07-01

Ludeme Description

Radran.lud

Concepts

Browse all concepts for Radran here.

Similar Games

Ciri Amber

Sim

Windir

Nedilmarth

DisPath

Oriath

MaxMatch

Nein Ari

Hamiltonian Maze

Crossline

Identifiers

DLP.Games.589


     Contact Us
     ludii.games@gmail.com
     cameron.browne@maastrichtuniversity.nl

lkjh Maastricht University Department of Advanced Computing Sciences (DACS), Paul-Henri Spaaklaan 1, 6229 EN Maastricht, Netherlands Funded by a €2m ERC Consolidator Grant (#771292) from the European Research Council