background Ludii Portal
Home of the Ludii General Game System


Part of the Digital Ludeme Project background    

Home Games Forum Downloads Tutorials Tournaments History World Map Team





Ulmar is a graph theory game, that is used the concepts of depth of a rooted tree. A rooted tree is a tree, which has a specific node-called root. The depth of a tree is the maximum number of edges from the root to any node.


Ulmar can be played with 1 or 2 players. The board graph is initially uncoloured edges and a coloured vertex, which is the root. Here is an integer k, where, 0 < k < number of vertices - 1. Player alternate tacking turns, in which the current player colour an uncoloured edge. In the puzzle, the aim of the player to make a tree with k depth from the root. On the other version, the game is won by the first player to make his friendly coloured tree with k depth.


Tahmina Begum

Creation date




     Contact Us

lkjh Maastricht University
Data Science and Knowledge Engineering (DKE)
Paul-Henri Spaaklaan 1, 6229 EN Maastricht, Netherlands
This project is funded by a 2m euro
ERC Consolidator Grant from the
European Research Council