Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Proof-number_search> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Proof-number_search abstract "Proof-number search (short: PN search) is a game tree search algorithm invented by Victor Allis, with applications mostly in endgame solvers, but also for sub-goals during games.Using a binary goal (e.g. first player wins the game), game trees of two-person perfect-information games can be mapped to an and–or tree. Maximizing nodes become OR-nodes, minimizing nodes are mapped to AND-nodes. For all nodes proof and disproof numbers are stored, and updated during the search.The proof and disproof numbers represent lower bounds on the number of nodes to be evaluated to prove (or disprove) certain nodes. By always selecting the most proving (disproving) node to expand, an efficient search is generated.Some variants of the like PN2, PDS-PN have been developed to address the quite big memoryrequirements of the algorithm.".
- Proof-number_search wikiPageID "23073520".
- Proof-number_search wikiPageRevisionID "552685610".
- Proof-number_search hasPhotoCollection Proof-number_search.
- Proof-number_search subject Category:Game_artificial_intelligence.
- Proof-number_search subject Category:Graph_algorithms.
- Proof-number_search subject Category:Search_algorithms.
- Proof-number_search type Abstraction100002137.
- Proof-number_search type Act100030358.
- Proof-number_search type Activity100407535.
- Proof-number_search type Algorithm105847438.
- Proof-number_search type Event100029378.
- Proof-number_search type GraphAlgorithms.
- Proof-number_search type Procedure101023820.
- Proof-number_search type PsychologicalFeature100023100.
- Proof-number_search type Rule105846932.
- Proof-number_search type SearchAlgorithms.
- Proof-number_search type YagoPermanentlyLocatedEntity.
- Proof-number_search comment "Proof-number search (short: PN search) is a game tree search algorithm invented by Victor Allis, with applications mostly in endgame solvers, but also for sub-goals during games.Using a binary goal (e.g. first player wins the game), game trees of two-person perfect-information games can be mapped to an and–or tree. Maximizing nodes become OR-nodes, minimizing nodes are mapped to AND-nodes.".
- Proof-number_search label "Proof-Number-Suche".
- Proof-number_search label "Proof-number search".
- Proof-number_search sameAs Proof-Number-Suche.
- Proof-number_search sameAs m.064qsjj.
- Proof-number_search sameAs Q2112910.
- Proof-number_search sameAs Q2112910.
- Proof-number_search sameAs Proof-number_search.
- Proof-number_search wasDerivedFrom Proof-number_search?oldid=552685610.
- Proof-number_search isPrimaryTopicOf Proof-number_search.