Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7233029> ?p ?o }
Showing triples 1 to 26 of
26
with 100 triples per page.
- Q7233029 subject Q7832255.
- Q7233029 subject Q8391389.
- Q7233029 abstract "In combinatorial game theory, poset games are mathematical games of strategy, generalizing many well-known games such as Nim and Chomp. In such games, two players start with a poset (a partially ordered set), and take turns choosing one point in the poset, removing it and all points that are greater. The player who is left with no point to choose, loses.".
- Q7233029 wikiPageWikiLink Q1076016.
- Q7233029 wikiPageWikiLink Q1150710.
- Q7233029 wikiPageWikiLink Q1158962.
- Q7233029 wikiPageWikiLink Q1320931.
- Q7233029 wikiPageWikiLink Q1507104.
- Q7233029 wikiPageWikiLink Q1687147.
- Q7233029 wikiPageWikiLink Q17502105.
- Q7233029 wikiPageWikiLink Q2289490.
- Q7233029 wikiPageWikiLink Q272404.
- Q7233029 wikiPageWikiLink Q272735.
- Q7233029 wikiPageWikiLink Q369377.
- Q7233029 wikiPageWikiLink Q474715.
- Q7233029 wikiPageWikiLink Q5179263.
- Q7233029 wikiPageWikiLink Q5637225.
- Q7233029 wikiPageWikiLink Q649676.
- Q7233029 wikiPageWikiLink Q7068967.
- Q7233029 wikiPageWikiLink Q724409.
- Q7233029 wikiPageWikiLink Q7247786.
- Q7233029 wikiPageWikiLink Q7832255.
- Q7233029 wikiPageWikiLink Q8391389.
- Q7233029 wikiPageWikiLink Q905967.
- Q7233029 comment "In combinatorial game theory, poset games are mathematical games of strategy, generalizing many well-known games such as Nim and Chomp. In such games, two players start with a poset (a partially ordered set), and take turns choosing one point in the poset, removing it and all points that are greater. The player who is left with no point to choose, loses.".
- Q7233029 label "Poset game".