A complete analysis of von Neumann's Hackendot (Q1139510): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: J. Úlehla / rank | |||
Property / author | |||
Property / author: J. Úlehla / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4099541 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5844986 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs and composite games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5761283 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 03:57, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A complete analysis of von Neumann's Hackendot |
scientific article |
Statements
A complete analysis of von Neumann's Hackendot (English)
0 references
1980
0 references
particular game
0 references
Nim like game
0 references
tree
0 references
Hackendot
0 references
impartial two-person combinatorial game
0 references
Hackendot-k
0 references
determination of winning strategy
0 references
finite game
0 references
move selection rule
0 references
explicit strategy description
0 references