{ "items" : [
    { "id" : "http://dbpedia.org/resource/Alpha–beta_pruning"
      "properties" : {
        "http://www.w3.org/2000/01/rdf-schema#comment" : [ "Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree. It is an adversarial search algorithm used commonly for machine playing of two-player games (Tic-tac-toe, Chess, Go, etc.). It stops completely evaluating a move when at least one possibility has been found that proves the move to be worse than a previously examined move. Such moves need not be evaluated further." ] ,
        "http://xmlns.com/foaf/0.1/depiction" : [ "http://commons.wikimedia.org/wiki/Special:FilePath/AB_pruning.svg" ] ,
        "http://dbpedia.org/ontology/thumbnail" : [ "http://commons.wikimedia.org/wiki/Special:FilePath/AB_pruning.svg?width=300"] } } }
