background Ludii Portal
Home of the Ludii General Game System

   

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


 
Hamiltonian Maze

Leaderboard

Period

Modern

Category Math, Graph

Description

A Hamiltonian cycle is a closed loop on a graph, where every node of the graph is visited exactly once. The goal of this puzzle is to colour edges such that the coloured edges form a Hamiltonian cycle.

Rules

Colour edges of the graph, by selecting them, until they form a path that passes through every vertex exactly once and returns to its starting point.

Author

Erich Friedman

Creation date

2009

Ludeme Description

Hamiltonian Maze.lud

Concepts

Browse all concepts for Hamiltonian Maze here.

Reference

stetson.edu

Identifiers

DLP.Games.544

     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 Funded by a €2m ERC Consolidator Grant (#771292) from the European Research Council