This HTML5 document contains 7 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

PrefixNamespace IRI
n4http://dbkwik.webdatacommons.org/resource/r0IHXQUiHMdRyU0eBu7M7A==
n7http://dbkwik.webdatacommons.org/ontology/
dctermshttp://purl.org/dc/terms/
n9http://dbkwik.webdatacommons.org/resource/lCQHAOVyuREVS-II4cqo6w==
n2http://dbkwik.webdatacommons.org/resource/Fked__m9G1Kud5oKIec0ug==
n5http://dbkwik.webdatacommons.org/resource/uYG7LcD2kqvqCE8nRBDsQw==
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
xsdhhttp://www.w3.org/2001/XMLSchema#
n8http://dbkwik.webdatacommons.org/resource/MwSv5w-B357Ngf_miYSfhg==
Subject Item
n2:
rdfs:label
Tchoukaillon
rdfs:comment
Tchoukaillon is a variant of Tchuka Ruma which was developed by the French mathematician Véronique Gautheron in 1977. The game received some attention in Combinatorial Game Theory. Duane Broline and Daniel Loeb found out in 1995 that the number of stones in a winning position is asymptotically bounded by n2/pi (given n pits). Tchoukaillon was called mancala ad infinitum by Gary Preisser, a student at Stetson University, Florida, who did a senior research project on the game in 1998. Monokalah and Multitchouka are Tchoukaillon variants proposed by the same author.
dcterms:subject
n4: n5: n8: n9:
n7:abstract
Tchoukaillon is a variant of Tchuka Ruma which was developed by the French mathematician Véronique Gautheron in 1977. The game received some attention in Combinatorial Game Theory. Duane Broline and Daniel Loeb found out in 1995 that the number of stones in a winning position is asymptotically bounded by n2/pi (given n pits). Tchoukaillon was called mancala ad infinitum by Gary Preisser, a student at Stetson University, Florida, who did a senior research project on the game in 1998. Monokalah and Multitchouka are Tchoukaillon variants proposed by the same author.