Oriath
Period
Modern
Category
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
Concepts
Browse all concepts for Oriath here.
Similar Games
Identifiers
DLP.Games.597
| 
