Language: | Slovenian |
---|---|
Year of publishing: | 2021 |
Typology: | 2.11 - Undergraduate Thesis |
Organization: | UL FRI - Faculty of Computer and Information Science |
Publisher: | [J. Kuhar] |
UDC: | 004:51(043.2) |
COBISS: | 79848195 |
Views: | 261 |
Downloads: | 38 |
Average score: | 0 (0 votes) |
Metadata: |
Secondary language: | English |
---|---|
Secondary title: | Sprouts - a combinatorial game |
Secondary abstract: | Sprouts is a paper-and-pencil game where two players take turns connecting sprouts and adding a new sprout along the connection. The player who makes the last move wins. The game of Sprouts is an impartial combinatorial game and thus by Sprague-Grundy theorem equivalent to a game of Nim. Planar graphs are the basis for a computer representation of Sprouts. Combinatorically, a game is a planar graph with sprouts as its vertices and moves as its edges. In addition, player's moves also have geometric components. Each move is a sequence of Bézier splines. Our contribution is the cobweb. A cobweb is comprised of the virtual edges which connect the initial sprouts into a spanning tree. The cobweb guarantees uniqueness of moves by maintaining a connected structure. As part of this work, a multi-platform application for playing Sprouts has been developed. |
Secondary keywords: | sprouts;impatial games;planar graphs;computer and information science;diploma;Računalništvo;Univerzitetna in visokošolska dela; |
Type (COBISS): | Bachelor thesis/paper |
Study programme: | 1000468 |
Thesis comment: | Univ. v Ljubljani, Fak. za računalništvo in informatiko |
Pages: | 38 str. |
ID: | 13587571 |