background Ludii Portal
Home of the Ludii General Game System

   

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


 
Nein Ari

Period

Modern

Category Experimental, Graph theory

Description

Nein Ari is a puzzle based on the graph theory concept of k-regular graphs. A k-regular 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 parameter-k version of the puzzle is to uncolour edges until the coloured graph is a k-regular graph.

Author

Tahmina Begum

Creation date

2020-05-25

Ludeme Description

Nein Ari.lud

Concepts

Browse all concepts for Nein Ari here.

Similar Games

Nedilmarth

Oriath

Hamiltonian Maze

Ciri Amber

SpanRups

Sim

Windir

Radran

Icosian

Crossline

Identifiers

DLP.Games.600


     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