Oriath
Leaderboard
Period(s)
Modern
Categories
Experimental, Graph theory.
Description
Oriath is a puzzle based on the graphtheoretic 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 kregular graph.
Rules
Oriath has two versions: general and parameterk. 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 parameterk version, the game is won by the last player to make a move such that the coloured graph is a kregular graph.
Author
Tahmina Begum
Creation date
20200525
Ludeme Description
Oriath.lud
Identifiers
DLP.Game.597
