Ordinal sums of impartial games
Autor(a) principal: | |
---|---|
Data de Publicação: | 2018 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10400.21/9108 |
Resumo: | 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 subordinate, but depends on the form of its base. In this work, we analyze g(G : H) where G and H are impartial forms, observing that the g-values are related to the concept of minimum excluded value of order k. As a case study, we introduce the ruleset OAK, a generalization of GREEN HACKENBUSH. By defining the operation gin sum, it is possible to determine the literal forms of the bases in polynomial time. (C) 2017 Elsevier B.V. All rights reserved. |
id |
RCAP_b2d5c5ed82c921b3bf6c58ed8d804bd3 |
---|---|
oai_identifier_str |
oai:repositorio.ipl.pt:10400.21/9108 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Ordinal sums of impartial gamesCombinatorial game theoryGin sumImpartial gamesMinimum excluded valueNormal-playOAKOrdinal sumIn 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 subordinate, but depends on the form of its base. In this work, we analyze g(G : H) where G and H are impartial forms, observing that the g-values are related to the concept of minimum excluded value of order k. As a case study, we introduce the ruleset OAK, a generalization of GREEN HACKENBUSH. By defining the operation gin sum, it is possible to determine the literal forms of the bases in polynomial time. (C) 2017 Elsevier B.V. All rights reserved.ElsevierRCIPLCarvalho, AldaNeto, JoãoSantos, Carlos2018-11-29T11:49:21Z2018-07-102018-07-10T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.21/9108engCARVALHO, Alda; NETO, João Pedro; SANTOS, Carlos – Ordinal sums of impartial games. Discrete Applied Mathematics. ISSN 0166-218X. Vol. 243 (2018), pp. 39-450166-218Xhttps://doi.org/10.1016/j.dam.2017.12.020metadata only accessinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-08-03T09:57:24Zoai:repositorio.ipl.pt:10400.21/9108Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:17:45.067955Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Ordinal sums of impartial games |
title |
Ordinal sums of impartial games |
spellingShingle |
Ordinal sums of impartial games Carvalho, Alda Combinatorial game theory Gin sum Impartial games Minimum excluded value Normal-play OAK Ordinal sum |
title_short |
Ordinal sums of impartial games |
title_full |
Ordinal sums of impartial games |
title_fullStr |
Ordinal sums of impartial games |
title_full_unstemmed |
Ordinal sums of impartial games |
title_sort |
Ordinal sums of impartial games |
author |
Carvalho, Alda |
author_facet |
Carvalho, Alda Neto, João Santos, Carlos |
author_role |
author |
author2 |
Neto, João Santos, Carlos |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
RCIPL |
dc.contributor.author.fl_str_mv |
Carvalho, Alda Neto, João Santos, Carlos |
dc.subject.por.fl_str_mv |
Combinatorial game theory Gin sum Impartial games Minimum excluded value Normal-play OAK Ordinal sum |
topic |
Combinatorial game theory Gin sum Impartial games Minimum excluded value Normal-play OAK Ordinal sum |
description |
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 subordinate, but depends on the form of its base. In this work, we analyze g(G : H) where G and H are impartial forms, observing that the g-values are related to the concept of minimum excluded value of order k. As a case study, we introduce the ruleset OAK, a generalization of GREEN HACKENBUSH. By defining the operation gin sum, it is possible to determine the literal forms of the bases in polynomial time. (C) 2017 Elsevier B.V. All rights reserved. |
publishDate |
2018 |
dc.date.none.fl_str_mv |
2018-11-29T11:49:21Z 2018-07-10 2018-07-10T00:00:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10400.21/9108 |
url |
http://hdl.handle.net/10400.21/9108 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
CARVALHO, Alda; NETO, João Pedro; SANTOS, Carlos – Ordinal sums of impartial games. Discrete Applied Mathematics. ISSN 0166-218X. Vol. 243 (2018), pp. 39-45 0166-218X https://doi.org/10.1016/j.dam.2017.12.020 |
dc.rights.driver.fl_str_mv |
metadata only access info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
metadata only access |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier |
publisher.none.fl_str_mv |
Elsevier |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799133440844496896 |