Kombinatorične igre na Ferrerovih diagramih – algoritmični pristop / Computational aspects of some combinatorial games on Ferrer’s diagrams

Več informacij o projektu / More info about the project

Naslov
Title
Kombinatorične igre na Ferrerovih diagramih – algoritmični pristop / Computational aspects of some combinatorial games on Ferrer’s diagrams
Akronim
Acronym
BI-US/22-24-164
Vodilna institucija
Leading institution
UP Famnit
Partnerske institucije
Partner institutions
Rhodes College
Vodja projekta
Project leader
Riste Škrekovski
Financer projekta
Funding Organization
/
Vrsta projekta
Project Type
Projekti bilaterale
Trajanje
Duration
01.07.2022 – 30.06.2024
Spletna stran projekta
Project website
/
Oddelek
Department
Oddelek za matematiko UP FAMNIT

Opis / Description

(SI) Kombinatorična teorija iger je pomembno in perspektivno področje, ki preučuje široko paleto iger, večinoma za dva igralca. Oba igralca imata ponavadi  popolno informacijo in, njune odločitve pa ne temeljijo na naključnosti.

Za igre, v katerih imata oba igralca enake možne premike v vsakem položaju, in kjer zmaga igralec ki naredi zadnjo potezo, sta Sprague in Grundy uvedla pomembno metodo klasifikacije igralnih pozicij, 
ki med drugim za poljuben položaj določi zmagovalca (ob predpostavki optimalne strategije obeh).
(EN) Combinatorial game theory is a large and growing field that includes in its scope a wide range of game types, generally focusing on two-player games in which both players have perfect information and there are no moves of chance.
Sprague and  Grundy introduced a method of quantifying game positions for impartial normal-play games, i.e., those in which both players have the same possible moves in each position. These Sprague-Grundy values are a generalization of winning and losing positions. 

Podeli z drugimi

Accessibility Toolbar