| http://dbpedia.org/ontology/abstract
|
Several map-coloring games are studied in … 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.ssible to play with Go stones or Checkers.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Map_coloring_game.png?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
3007111
|
| http://dbpedia.org/ontology/wikiPageLength
|
6572
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1102605926
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Mis%C3%A8re_game +
, http://dbpedia.org/resource/File:Map_coloring_game.png +
, http://dbpedia.org/resource/Glossary_of_graph_theory +
, http://dbpedia.org/resource/Impartial_game +
, http://dbpedia.org/resource/Category:Mathematical_games +
, http://dbpedia.org/resource/On_Numbers_and_Games +
, http://dbpedia.org/resource/Academic_Press +
, http://dbpedia.org/resource/Your_Move:_logic%2C_math_and_word_puzzles_for_enthusiasts +
, http://dbpedia.org/resource/Your_Move_%28book%29 +
, http://dbpedia.org/resource/Combinatorial_game_theory +
, http://dbpedia.org/resource/Category:Combinatorial_game_theory +
, http://dbpedia.org/resource/Partisan_game +
, http://dbpedia.org/resource/Checkers +
, http://dbpedia.org/resource/McGraw-Hill +
, http://dbpedia.org/resource/Angel_problem +
, http://dbpedia.org/resource/A_K_Peters +
, http://dbpedia.org/resource/Mis%C3%A8re +
, http://dbpedia.org/resource/Four_color_theorem +
, http://dbpedia.org/resource/Map-coloring_problem +
, http://dbpedia.org/resource/On_numbers_and_games +
, http://dbpedia.org/resource/Go_%28board_game%29 +
, http://dbpedia.org/resource/Dover_Press +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Cite_book +
, http://dbpedia.org/resource/Template:Main +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Mathematical_games +
, http://dbpedia.org/resource/Category:Combinatorial_game_theory +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Map-coloring_games?oldid=1102605926&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Map_coloring_game.png +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Map-coloring_games +
|
| owl:sameAs |
https://global.dbpedia.org/id/4rVLG +
, http://www.wikidata.org/entity/Q6753710 +
, http://dbpedia.org/resource/Map-coloring_games +
, http://yago-knowledge.org/resource/Map-coloring_games +
, http://rdf.freebase.com/ns/m.08k4yn +
|
| rdf:type |
http://dbpedia.org/class/yago/Game100456199 +
, http://dbpedia.org/class/yago/WikicatMathematicalGames +
, http://dbpedia.org/class/yago/YagoPermanentlyLocatedEntity +
, http://dbpedia.org/class/yago/Contest107456188 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/Event100029378 +
, http://dbpedia.org/class/yago/SocialEvent107288639 +
, http://dbpedia.org/class/yago/PsychologicalFeature100023100 +
|
| rdfs:comment |
Several map-coloring games are studied in … 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.ition are features of the particular game.
|
| rdfs:label |
Map-coloring games
|
