background Ludii Portal
Home of the Ludii General Game System

   

Part of the Digital Ludeme Project background    

Home Games Forum Downloads Tutorials Tournaments History World Map Team


 
Oriath

Leaderboard

Period(s)

Modern

Categories

Experimental, Graph theory.

Description

Oriath is a puzzle based on the graph-theoretic concept of regular graphs. A regular graph is a graph where each vertex has the same number of neighbours; i.e. every vertex has the same degree. Moreover, if a regular graph has k degree, then it's called a k-regular graph.

Rules

Oriath has two versions: general and parameter-k. In both versions, the graph is initially uncoloured. Player alternate taking turns, in which the current player colours an uncoloured edge. In the general version, the last player to make a move such that the coloured graph becomes a regular graph wins. For the parameter-k version, the game is won by the last player to make a move such that the coloured graph is a k-regular graph.

Author

Tahmina Begum

Creation date

2020-05-25

Ludeme Description

Oriath.lud

Identifiers

DLP.Game.597

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

lkjh Maastricht University
Data Science and Knowledge Engineering (DKE)
Paul-Henri Spaaklaan 1, 6229 EN Maastricht, Netherlands
This project is funded by a 2m euro
ERC Consolidator Grant from the
European Research Council