Ordinal sums of impartial games
In an ordinal sum of two combinatorial games G and H, denoted by G : H, a player may move in either G (base) or H (subordinate), with the additional constraint that any move on G completely annihilates the component H. It is well-known that the ordinal sum does not depend on the form of its subordin...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2018
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10400.21/9108 |
| País: | Portugal |
| Oai: | oai:repositorio.ipl.pt:10400.21/9108 |