Akademska digitalna zbirka SLovenije - logo
ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • Sprague–Grundy values and complexity for LCTR
    Gottlieb, Eric ; Krnc, Matjaž, 1987- ; Muršič, Peter
    Given an integer partition of , we consider the impartial combinatorial game LCTR in which moves consist of removing either the left column or top row of its Young diagram. We show that for both ... normal and misère play, the optimal strategy can consist mostly of mirroring the opponent’s moves. We also establish that both LCTR and Downright are domestic as well as returnable, and on the other hand neither tame nor forced. For both games, those structural observations allow for computing the Sprague–Grundy value any position in time, assuming that the time unit allows for reading an integer, or performing a basic arithmetic operation. This improves on the previously known bound of due to Ilić (2019). We also cover some other complexity measures of both games, such as state–space complexity, and number of leaves and nodes in the corresponding game tree.
    Source: Discrete applied mathematics. - ISSN 0166-218X (Vol. 346, mar. 2024, str. 154-169)
    Type of material - article, component part ; adult, serious
    Publish date - 2024
    Language - english
    COBISS.SI-ID - 178885891