Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Map-coloring_games> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- Map-coloring_games abstract "Several map-coloring games are studied in combinatorial game theory. The general idea is that we are given a map with regions drawn in but with not all the regions colored. Two players, Left and Right, take turns coloring in one uncolored region per turn, subject to various constraints. The move constraints and the winning condition are features of the particular game.Some players find it easier to color vertices of the dual graph, as in the Four color theorem. In this method of play, the regions are represented by small circles, and the circles for neighboring regions are linked by line segments or curves. The advantages of this method are that only a small area need be marked on a turn, and that the representation usually takes up less space on the paper or screen. The first advantage is less important when playing with a computer interface instead of pencil and paper. It is also possible to play with Go stones or Checkers.".
- Map-coloring_games wikiPageID "3007111".
- Map-coloring_games wikiPageRevisionID "293387694".
- Map-coloring_games hasPhotoCollection Map-coloring_games.
- Map-coloring_games subject Category:Combinatorial_game_theory.
- Map-coloring_games subject Category:Mathematical_games.
- Map-coloring_games type Abstraction100002137.
- Map-coloring_games type Contest107456188.
- Map-coloring_games type Event100029378.
- Map-coloring_games type Game100456199.
- Map-coloring_games type MathematicalGames.
- Map-coloring_games type PsychologicalFeature100023100.
- Map-coloring_games type SocialEvent107288639.
- Map-coloring_games type YagoPermanentlyLocatedEntity.
- Map-coloring_games comment "Several map-coloring games are studied in combinatorial game theory. The general idea is that we are given a map with regions drawn in but with not all the regions colored. Two players, Left and Right, take turns coloring in one uncolored region per turn, subject to various constraints. The move constraints and the winning condition are features of the particular game.Some players find it easier to color vertices of the dual graph, as in the Four color theorem.".
- Map-coloring_games label "Map-coloring games".
- Map-coloring_games sameAs m.08k4yn.
- Map-coloring_games sameAs Q6753710.
- Map-coloring_games sameAs Q6753710.
- Map-coloring_games sameAs Map-coloring_games.
- Map-coloring_games wasDerivedFrom Map-coloring_games?oldid=293387694.
- Map-coloring_games isPrimaryTopicOf Map-coloring_games.