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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n8https://global.dbpedia.org/id/
n16http://webdocs.cs.ualberta.ca/~games/go/seminar/2002/020717/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Benson's_algorithm
dbo:wikiPageWikiLink
dbr:Benson's_algorithm_(Go)
Subject Item
dbr:Benson's_algorithm_(Go)
rdf:type
owl:Thing
rdfs:label
Benson's algorithm (Go)
rdfs:comment
In the game Go, Benson's algorithm (named after David B. Benson) can be used to determine the stones which are safe from capture no matter how many turns in a row the opposing player gets, i.e. unconditionally alive.
dcterms:subject
dbc:Computer_Go
dbo:wikiPageID
35169884
dbo:wikiPageRevisionID
1095740828
dbo:wikiPageWikiLink
dbr:Benson's_algorithm dbr:Go_and_mathematics dbr:Go_strategy_and_tactics dbr:Without_loss_of_generality dbc:Computer_Go dbr:God's_algorithm dbr:Multi-objective_optimization dbr:Go_(game) dbr:Linear_programming dbr:Computer_Go
dbo:wikiPageExternalLink
n16:benson.pdf%7Cformat=pdf%7Caccessdate=March
owl:sameAs
n8:4XkVC freebase:m.0j64bf7 wikidata:Q4890228
dbp:wikiPageUsesTemplate
dbt:GoBoardGame dbt:Go_(game) dbt:Short_description dbt:Reflist dbt:Distinguish dbt:Cite_journal
dbo:abstract
In the game Go, Benson's algorithm (named after David B. Benson) can be used to determine the stones which are safe from capture no matter how many turns in a row the opposing player gets, i.e. unconditionally alive.
prov:wasDerivedFrom
wikipedia-en:Benson's_algorithm_(Go)?oldid=1095740828&ns=0
dbo:wikiPageLength
3363
foaf:isPrimaryTopicOf
wikipedia-en:Benson's_algorithm_(Go)
Subject Item
dbr:Computer_Go
dbo:wikiPageWikiLink
dbr:Benson's_algorithm_(Go)
Subject Item
wikipedia-en:Benson's_algorithm_(Go)
foaf:primaryTopic
dbr:Benson's_algorithm_(Go)