Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/MTD-f> ?p ?o }
Showing triples 1 to 43 of
43
with 100 triples per page.
- MTD-f abstract "MTD(f), is a minimax search algorithm, developed in 1994 by Aske Plaat, Jonathan Schaeffer, Wim Pijls, and Arie de Bruin. Experiments with tournament-quality chess, checkers, and Othello programs show it to be the most efficient minimax algorithm. The name MTD(f) is an abbreviation for MTD(n,f) (Memory-enhanced Test Driver with node n and value f). It is an alternative to the alpha-beta pruning algorithm.".
- MTD-f wikiPageExternalLink mtdf-algorithm.
- MTD-f wikiPageExternalLink citation.cfm?id=240998&coll=GUIDE&dl=GUIDE&CFID=50049687&CFTOKEN=16181537.
- MTD-f wikiPageExternalLink chess.
- MTD-f wikiPageID "2381022".
- MTD-f wikiPageLength "5211".
- MTD-f wikiPageOutDegree "24".
- MTD-f wikiPageRevisionID "706443485".
- MTD-f wikiPageWikiLink Alphabeta_(disambiguation).
- MTD-f wikiPageWikiLink Alpha–beta_pruning.
- MTD-f wikiPageWikiLink Arie_de_Bruin.
- MTD-f wikiPageWikiLink Aske_Plaat.
- MTD-f wikiPageWikiLink Category:Articles_with_example_pseudocode.
- MTD-f wikiPageWikiLink Category:Search_algorithms.
- MTD-f wikiPageWikiLink Chess_engine.
- MTD-f wikiPageWikiLink Chinook_(draughts_player).
- MTD-f wikiPageWikiLink George_Stockman.
- MTD-f wikiPageWikiLink Jonathan_Schaeffer.
- MTD-f wikiPageWikiLink Judea_Pearl.
- MTD-f wikiPageWikiLink Keyano.
- MTD-f wikiPageWikiLink Minimax.
- MTD-f wikiPageWikiLink Phoenix_(chess_program).
- MTD-f wikiPageWikiLink Principal_variation_search.
- MTD-f wikiPageWikiLink Recursion_(computer_science).
- MTD-f wikiPageWikiLink SSS*.
- MTD-f wikiPageWikiLink Transposition_table.
- MTD-f wikiPageWikiLink Wim_Pijls.
- MTD-f wikiPageWikiLinkText "MTD-f".
- MTD-f subject Category:Articles_with_example_pseudocode.
- MTD-f subject Category:Search_algorithms.
- MTD-f hypernym Algorithm.
- MTD-f type Software.
- MTD-f type Algorithm.
- MTD-f type Redirect.
- MTD-f comment "MTD(f), is a minimax search algorithm, developed in 1994 by Aske Plaat, Jonathan Schaeffer, Wim Pijls, and Arie de Bruin. Experiments with tournament-quality chess, checkers, and Othello programs show it to be the most efficient minimax algorithm. The name MTD(f) is an abbreviation for MTD(n,f) (Memory-enhanced Test Driver with node n and value f). It is an alternative to the alpha-beta pruning algorithm.".
- MTD-f label "MTD-f".
- MTD-f sameAs Q622158.
- MTD-f sameAs الگوریتم_امتیدی-اف.
- MTD-f sameAs MTD-f.
- MTD-f sameAs m.077xg2.
- MTD-f sameAs Q622158.
- MTD-f wasDerivedFrom MTD-f?oldid=706443485.
- MTD-f isPrimaryTopicOf MTD-f.