Add to ORKGWe analyze several perfect-information combinatorial games played on planar triangulations. We introduce three broad categories of such games: constructing, transforming, and marking triangulations. In various situations, we develop polynomial-time algorithms to determine who wins a given game under optimal play, and to find a winning strategy. Along the way, we show connections to existing combinatorial games such as Kayles
We introduce a new abstract graph game, SWAP PLANARITY, where the goal is to reach a state without e...
We introduce a new abstract graph game, SWAP PLANARITY, where the goal is to reach a state without e...
\u3cp\u3eWe introduce a new abstract graph game, Swap Planarity, where the goal is to reach a state ...
We analyze several perfect-information combinatorial games played on planar triangulations. We intr...
We analyze several perfect-information combinatorial games played on planar triangulations. We intro...
AbstractWe analyze several perfect-information combinatorial games played on planar triangulations. ...
Abstract. We analyze several perfect-information combinatorial games played on planar triangulations...
AbstractWe analyze several perfect-information combinatorial games played on planar triangulations. ...
There are several known methods to find winning strategies for two-player combinatorial games. This ...
Combinatorial games are a fascinating topic, as both recreational and serious mathematics. One aspec...
We introduce a new abstract graph game, Swap Planarity, where the goal is to reach a state without e...
We introduce a new abstract graph game, Swap Planarity, where the goal is to reach a state without e...
We introduce a new abstract graph game, Swap Planarity, where the goal is to reach a state without e...
We introduce a new abstract graph game, SWAP PLANARITY, where the goal is to reach a state without e...
We introduce a new abstract graph game, SWAP PLANARITY, where the goal is to reach a state without e...
We introduce a new abstract graph game, SWAP PLANARITY, where the goal is to reach a state without e...
We introduce a new abstract graph game, SWAP PLANARITY, where the goal is to reach a state without e...
\u3cp\u3eWe introduce a new abstract graph game, Swap Planarity, where the goal is to reach a state ...
We analyze several perfect-information combinatorial games played on planar triangulations. We intr...
We analyze several perfect-information combinatorial games played on planar triangulations. We intro...
AbstractWe analyze several perfect-information combinatorial games played on planar triangulations. ...
Abstract. We analyze several perfect-information combinatorial games played on planar triangulations...
AbstractWe analyze several perfect-information combinatorial games played on planar triangulations. ...
There are several known methods to find winning strategies for two-player combinatorial games. This ...
Combinatorial games are a fascinating topic, as both recreational and serious mathematics. One aspec...
We introduce a new abstract graph game, Swap Planarity, where the goal is to reach a state without e...
We introduce a new abstract graph game, Swap Planarity, where the goal is to reach a state without e...
We introduce a new abstract graph game, Swap Planarity, where the goal is to reach a state without e...
We introduce a new abstract graph game, SWAP PLANARITY, where the goal is to reach a state without e...
We introduce a new abstract graph game, SWAP PLANARITY, where the goal is to reach a state without e...
We introduce a new abstract graph game, SWAP PLANARITY, where the goal is to reach a state without e...
We introduce a new abstract graph game, SWAP PLANARITY, where the goal is to reach a state without e...
\u3cp\u3eWe introduce a new abstract graph game, Swap Planarity, where the goal is to reach a state ...