7 citations · 8 across the 22 of their papers we have counts for
6 papers · 1 filter
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…