• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: ActivityStreamsMapasEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transurn:det:rdf:labelvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties: Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects
  • "Same As": Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects (recommended) Apply to subjects, objects and predicates (not recommended on big datasets) Apply to predicates only (special use cases only)

About: Rook and bishop versus rook endgame     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)

The rook and bishop versus rook endgame is a chess endgame where one player has just a king, a rook, and a bishop, and the other player has just a king and a rook. This combination of material is one of the most common pawnless chess endgames. It is generally a theoretical draw, but the rook and bishop have good winning chances in practice because the defense is difficult. Ulf Andersson won the position twice within a year, once against a grandmaster and once against a candidate master; and grandmaster Keith Arkell has won it 18 times out of 18. In positions that have a forced win, up to 59 moves are required. Tony Kosten has seen the endgame many times in master games, with the stronger side almost always winning. Pal Benko called this the "headache ending."