Vaš brskalnik ne omogoča JavaScript!
JavaScript je nujen za pravilno delovanje teh spletnih strani. Omogočite JavaScript ali pa uporabite sodobnejši brskalnik.
Repozitorij Univerze v Ljubljani
Nacionalni portal odprte znanosti
Odprta znanost
DiKUL
slv
|
eng
Iskanje
Brskanje
Novo v RUL
Kaj je RUL
V številkah
Pomoč
Prijava
Podrobno
Kombinatorična igra filozofov nogomet
ID
DREVENŠEK, MARKO
(
Avtor
),
ID
Fijavž, Gašper
(
Mentor
)
Več o mentorju...
PDF - Predstavitvena datoteka,
prenos
(1,72 MB)
MD5: 2E5582554E8A5EEDC97E9375F30443DE
PID:
20.500.12556/rul/ac71a937-8901-4257-8070-a714c4590951
Galerija slik
Izvleček
Kombinatorične igre so igre, kjer igralca izmenično izvajata poteze. Pri igri nimamo nikakršnih pripomočkov, ki bi na igro vplivali naključno. Igralca imata popolno informacijo o preteklih potezah za odločanje, kako igrati naprej. Pravila so takšna, da je igra končna. V delu predstavimo malo znano igro filozofov nogomet oziroma figomet. Predstavimo, zakaj je igra težka, in zakaj je odločiti, ali lahko igralec v dani situaciji zmaga z eno potezo, NP-poln problem. Dokazovanja smo se lotili s prevedbo že znanega NP-polnega problema 3-SAT. Poleg tega smo implementirali igro kot aplikacijo za dva igralca, ki je dostopna preko spletnega brskalnika.
Jezik:
Slovenski jezik
Ključne besede:
kombinatorična igra
,
računska zahtevnost
,
filozofov nogomet
,
NP-polnost
,
3-izpolnljivost
,
spletna aplikacija.
Vrsta gradiva:
Diplomsko delo
Organizacija:
FRI - Fakulteta za računalništvo in informatiko
Leto izida:
2016
PID:
20.500.12556/RUL-91238
Datum objave v RUL:
27.03.2017
Število ogledov:
2176
Število prenosov:
600
Metapodatki:
Citiraj gradivo
Navadno besedilo
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
DREVENŠEK, MARKO, 2016,
Kombinatorična igra filozofov nogomet
[na spletu]. Diplomsko delo. [Dostopano 13 julij 2025]. Pridobljeno s: https://repozitorij.uni-lj.si/IzpisGradiva.php?lang=slv&id=91238
Kopiraj citat
Objavi na:
Sekundarni jezik
Jezik:
Angleški jezik
Naslov:
Philosopher's football
Izvleček:
Combinatorial games are games where the players alternately take moves. In the game we do not have any chance devices that could impact on the game randomly. Players have complete information about past moves to decide how to play on. The rules are such that the game must eventually end. Philosopher’s football or Phutball is a not so well-known combinatorial game which is the focus of this work. We present why the game is difficult and why determing whether a player can win in a given situation in one move is an NP-complete problem. We prove it by reducing to an already known NP-complete problem 3-SAT. We have also implemented Phutball application for two players, which is accessible through a web browser.
Ključne besede:
combinatorial game
,
computational complexity
,
Philosopher's football
,
NP-completeness
,
3-SAT
,
web application.
Podobna dela
Podobna dela v RUL:
Quantification of selected novel inhibitors of butylcholinesterase in brain tissue and blood plasma of a rat
Development of a rat blood plasma and brain tissue sample preparation procedure for the quantification of novel cholinestease inhibitors
Mechanisms of vesiculation and stability of vesicular structures in samples of human blood plasma and marine microalgae
Viscosity of plasma as a key factor in assessment of extracellular vesicles by light scattering
Identification of Aggregatibacter acinomycetemcomitans RNA binding proteins
Podobna dela v drugih slovenskih zbirkah:
Separation of porcine blood and electrophoresis proteins in porcine blood plasma
Structural and functional determinants of TDP-43 aggregation
Measurement of prostanoids in human blood plasma with the use of gas cromatography and mass spectrometry
Rapid and sensitive determination of ChE activity in blood plasma
Nazaj