The Ungar games (Q6548025)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7857943
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Ungar games |
scientific article; zbMATH DE number 7857943 |
Statements
The Ungar games (English)
0 references
31 May 2024
0 references
From the structures of a finite lattice they developed a 2-players combinatorial game defining an Ungar move. They proved results for characterizing issues on the principal order ideals, characterized the winner strategies, among other theoretical results. The computational complexity of these games are also given.
0 references
lattice
0 references
combinatorial game
0 references
Ungar move
0 references
Young's lattice
0 references
Tamari lattice
0 references
weak order
0 references
0.7470673322677612
0 references
0.729379415512085
0 references
0.7289590835571289
0 references
0.728912889957428
0 references
0.7247278094291687
0 references
