7 citations · 8 across the 22 of their papers we have counts for
22 papers
Tasty Chocolate Games
François Carret, Koki Suetsugu
In this paper, we investigate Chocolate Games. In Chocolate Games, each player cuts a chocolate bar into two chocolate bars and eats one of them so that they do not eat an indicate…
A duality of misère games and play with a pass
Koki Suetsugu
In combinatorial game theory, the choice of play convention is a fundamental aspect of the theory. The two most widely studied conventions are normal play, in which the player who…
Cyclic impartial games with carry-on moves
Tomoaki Abuku, Alda Carvalho, Urban Larsson +3
In an impartial combinatorial game, both players have the same options in the game and all its subpositions. The classical Sprague-Grundy Theory was developed for short impartial g…
-Ending partisan rulesets
Hiroki Inazu, Shun-ichi Kimura, Koki Suetsugu
In this paper, we consider -ending partisan rulesets as a branch of combinatorial game theory. In these rulesets, the sets of options of both players are th…
Digraph Yama Nim
Hiyu Inoue, Shun-ichi Kimura, Hikaru Manabe +3
{\sc Yama Nim} is a variant of two piles {\sc Nim}. In this ruleset, the player chosses one of the piles and removes at least two tokens from the pile. In the same move, the player…
Combinatorial Games and the Golden Ratio on Digraphs
Tomoaki Abuku, Hiroki Inazu, Hiyu Inoue +4
We introduce a new combinatorial game called Triangle Game. In this game, a directed -cycle graph is given, and stones are placed on each vertex. The player chooses a directed e…
On the Sprague-Grundy values of games with a pass
Hikaru Manabe, Ryohei Miyadera, Koki Suetsugu
In this paper, we consider two-player impartial games with a pass-move. A disjunctive compound of games is a position in which, on each turn, the current player chooses one of the…
Extended circular nim
Koki Suetsugu
Circular nim is a variant of nim, in which there are piles of tokens arranged in a circle and each player, in their turn, chooses at most consecutive piles in th…
Relationship between misère NIM and two-player GOISHI HIROI
Tomoaki Abuku, Masanori Fukui, Shin-ichi Katayama +1
In combinatorial game theory, there are two famous winning conventions, normal play and misère play. Under normal play convention, the winner is the player who moves last and under…
What happens when we add impartial loopy games and impartial entailing games?
Koki Suetsugu
The disjunctive sum of impartial games is analyzed by Sprague-Grundy theory. The theory has been extended to loopy games and entailing games by early results. In this study, we con…
Enforce and selective operators of combinatorial games
Tomoaki Abuku, Shun-ichi Kimura, Hironori Kiya +4
We consider an {\em enforce operator} on impartial rulesets similar to the Muller Twist and the comply/constrain operator of Smith and St\u anic\u a, 2002. Applied to the rulesets…
A complete solution for the partisan chocolate game
Tomoaki Abuku, Hikaru Manabe, Richard J. Nowakowski +2
The class of Poset Take-Away games includes many interesting and difficult games. Playing on an -dimensional positive quadrant (the origin being the bottom of the poset) gives r…
Turning Tiles is PSPACE-complete
Kanae Yoshiwatari, Hironori Kiya, Koki Suetsugu +2
In combinatorial game theory, the winning player for a position in normal play is analyzed and characterized via algebraic operations. Such analyses define a value for each positio…
Hardness of braided quantum circuit optimization in the surface code
Kunihiro Wasa, Shin Nishio, Koki Suetsugu +4
Large-scale quantum information processing requires the use of quantum error correcting codes to mitigate the effects of noise in quantum devices. Topological error-correcting code…
Some extensions of Delete Nim
Tomoaki Abuku, Ko Sakai, Masato Shinoda +1
Nim is a well-known combinatorial game with several variants, e.g., Delete Nim and Variant Delete Nim. In Variant Delete Nim, the player deletes one of the two heaps of stones and…
New universal partizan rulesets and a new universal dicotic partisan ruleset
Koki Suetsugu
Universal partizan ruleset is a ruleset in which every game value of partizan games can be appear as a position. So far, generalized konane and turning tiles have been proved to be…
Improving upper and lower bounds of the number of games born by day 4
Koki Suetsugu
In combinatorial game theory, the lower and upper bounds of the number of games born by day have been recognized as and , respectively. In this st…
Playing impartial games on a simplicial complex as an extension of the emperor sum theory
Koki Suetsugu
In this paper, we considered impartial games on a simplicial complex. Each vertex of a given simplicial complex acts as a position of an impartial game. Each player in turn chooses…
Discovering a new universal partizan ruleset
Koki Suetsugu
In Combinatorial Game Theory, we study the set of games G, whose elements are mapped from positions of rulesets. In many case, given a ruleset, not all elements of G can be given a…
Delete Nim
Koki Suetsugu, Tomoaki Abuku
In this paper, we study an impartial game called Delete Nim. In this game, there are two heaps of stones. The player chooses one of the heaps and delete the other heap. Next, she t…
On a Combination of the Cyclic Nimhoff and Subtraction Games
Tomoaki Abuku, Masanori Fukui, Ko Sakai +1
In this paper, we study a combination (called the generalized cyclic Nimhoff) of the cyclic Nimhoff and subtraction games. We give the -value of the game when all the…
Ryuo Nim: A Variant of the classical game of Wythoff Nim
Ryohei Miyadera, Yuki Tokuni, Yushi Nakaya +3
The authors introduce the impartial game of the generalized Ryūō Nim, a variant of the classical game of Wythoff Nim. In the latter game, two players take turns in moving a single…