Chess-like games are dominance solvable in at most two steps (Q1593744)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Chess-like games are dominance solvable in at most two steps |
scientific article; zbMATH DE number 1556918
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chess-like games are dominance solvable in at most two steps |
scientific article; zbMATH DE number 1556918 |
Statements
Chess-like games are dominance solvable in at most two steps (English)
0 references
25 January 2001
0 references
finite games of perfect information
0 references
dominated strategies
0 references
0.8455584645271301
0 references
0.7672418355941772
0 references
0.7461435794830322
0 references
0.7415388226509094
0 references
0.7370098233222961
0 references
