On emulational equivalence of impartial games and the game Hackenforb
DOI:
https://doi.org/10.55016/ojs/cdm.v20i2.73928Abstract
We introduce a variant of the game Hackenbush, called Hackenforb. It is a class of games, each of which is determined by two parameters: a given graph, and a given set of connected graphs (called forbidden graphs). The significance of this game within the realm of impartial combinatorial games is reflected in the fact that, as we show in this article, various known combinatorial games, such as Nim, Subtraction game, Notakto, Treblecross, Chomp, are emulationally equivalent to an instance of Hackenforb (an emulational equivalence of two games is a concept stronger than Grundy-equivalence, but weaker than the isomorphism between games' structures; our belief is that this version of equivalence is what really captures the core of the intuitive perception of what it means for two games to be ``basically the same game"). At the end of our article, we show that Hackenforb is, unfortunately, not ``almighty," that is, we describe a game that is not emulationally equivalent to an instance of Hackenforb.
Downloads
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Bojan Bašić, Nikola Milosavljević, Danijela Mitrovic
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.
This copyright statement was adapted from the statement for the University of Calgary Repository and from the statement for the Electronic Journal of Combinatorics (with permission).
The copyright policy for Contributions to Discrete Mathematics (CDM) is changed for all articles appearing in issues of the journal starting from Volume 15 Number 3.
Author(s) retain copyright over submissions published starting from Volume 15 number 3. When the author(s) indicate approval of the finalized version of the article provided by the technical editors of the journal and indicate approval, they grant to Contributions to Discrete Mathematics (CDM) a world-wide, irrevocable, royalty free, non-exclusive license as described below:
The author(s) grant to CDM the right to reproduce, translate (as defined below), and/or distribute the material, including the abstract, in print and electronic format, including but not limited to audio or video.
The author(s) agree that the journal may translate, without changing the content the material, to any medium or format for the purposes of preservation.
The author(s) also agree that the journal may keep more than one copy of the article for the purposes of security, back-up, and preservation.
In granting the journal this license the author(s) warrant that the work is their original work and that they have the right to grant the rights contained in this license.
The authors represent that the work does not, to the best of their knowledge, infringe upon anyone’s copyright.
If the work contains material for which the author(s) do not hold copyright, the author(s) represent that the unrestricted permission of the copyright holder(s) to grant CDM the rights required by this license has been obtained, and that such third-party owned material is clearly identified and acknowledged within the text or content of the work.
The author(s) agree to ensure, to the extent reasonably possible, that further publication of the Work, with the same or substantially the same content, will acknowledge prior publication in CDM.
The journal highly recommends that the work be published with a Creative Commons license. Unless otherwise arranged at the time the finalized version is approved and the licence granted with CDM, the work will appear with the CC-BY-ND logo. Here is the site to get more detail, and an excerpt from the site about the CC-BY-ND. https://creativecommons.org/licenses/
Attribution-NoDerivs
CC BY-ND
This license lets others reuse the work for any purpose, including commercially; however, it cannot be shared with others in adapted form, and credit must be provided to you.