Martin Blahynka

Bachelor's thesis

Non-wellfounded Conway games

Non-wellfounded Conway games
Abstract:
Conwayovy hry patří mezi partyzánské kombinatorické hry dvou hráčů. V této práci formalizujeme Conwayovy hry pomocí jednoduchého grafového modelu. V takto zavedeném formalizmu dokazujeme tzv. determinacy theorem. Dále formalizujeme poziční hry a ukazujeme, jak je možné redukovat Conwayovy hry na poziční hry a naopak.
Abstract:
Conway games are a type of partisan combinatorial game between two players. We give an exposition of (possibly non-well-founded) Conway games based on a simple graph model. We consider every infinite play to be a draw. In this formalism we prove determinacy of Conway games. We similarly formalise positional games – another type of game – and show how the two types of games can be reduced to each other …more
 

Keywords

Conway games winning regions determinacy positional games
 
Language used: English
Date on which the thesis was submitted / produced: 26. 5. 2020
Identifier: https://is.muni.cz/th/uetk5/

Thesis defence

  • Date of defence: 25. 6. 2020
  • Supervisor: Dr. rer. nat. Achim Blumensath
  • Reader: prof. RNDr. Antonín Kučera, Ph.D.

Citation record

Cite this text

Full text of thesis

Contents of on-line thesis archive
Published in Theses:
  • světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatiky
Složka Reference to the local database directory of the institution

Masaryk University

Faculty of Informatics

Bachelor programme / field:
Informatics / Mathematical Informatics

Theses on a related topic

List of theses with an identical keyword.