Nein Ari
Period
Modern
Category
Experimental, Graph theory
Description
Nein Ari is a puzzle based on the graph theory concept of kregular graphs. A kregular graph is a graph where every vertex has exactly k neighbours (i.e. every vertex has a degree of k).
Rules
The graph is initially coloured. The goal of the general version of the puzzle is to uncolour edges until the coloured graph is a regular graph. The goal of the parameterk version of the puzzle is to uncolour edges until the coloured graph is a kregular graph.
Author
Tahmina Begum
Creation date
20200525
Ludeme Description
Nein Ari.lud
Concepts
Browse all concepts for Nein Ari here.
Identifiers
DLP.Games.600
