Difference between revisions of "Best-First"

From Chessprogramming wiki
Jump to: navigation, search
 
(6 intermediate revisions by 2 users not shown)
Line 11: Line 11:
 
* [[B*]]
 
* [[B*]]
 
* [[Bandwidth Search]]
 
* [[Bandwidth Search]]
 +
* [[Best-First Minimax Search]]
 
* [[Conspiracy Number Search]]
 
* [[Conspiracy Number Search]]
 
* [[Ari Weinstein#FSSS-Minimax|FSSS-Minimax]]
 
* [[Ari Weinstein#FSSS-Minimax|FSSS-Minimax]]
Line 67: Line 68:
 
* [[Ayumu Nagai]], [[Hiroshi Imai]] ('''2002'''). ''[http://ci.nii.ac.jp/naid/110006376599 Proof for the Equivalence Between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees]''. [http://ci.nii.ac.jp/vol_issue/nels/AA10826272/ISS0000408668_en.html IEICE transactions on information and systems]
 
* [[Ayumu Nagai]], [[Hiroshi Imai]] ('''2002'''). ''[http://ci.nii.ac.jp/naid/110006376599 Proof for the Equivalence Between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees]''. [http://ci.nii.ac.jp/vol_issue/nels/AA10826272/ISS0000408668_en.html IEICE transactions on information and systems]
 
==2010 ...==
 
==2010 ...==
 +
* [[Akihiro Kishimoto]], [[Alex Fukunaga]], [[Adi Botea]]  ('''2012'''). ''Evaluation of a Simple, Scalable, Parallel Best-First Search Strategy''. [https://arxiv.org/abs/1201.3204 arXiv:1201.3204]
 
* [[Ari Weinstein]], [[Michael L. Littman]], [[Sergiu Goschin]] ('''2013'''). ''[http://proceedings.mlr.press/v24/weinstein12a.html Rollout-based Game-tree Search Outprunes Traditional Alpha-beta]''. [http://proceedings.mlr.press/ PMLR], Vol. 24 » [[Ari Weinstein#FSSS-Minimax|FSSS-Minimax]]
 
* [[Ari Weinstein]], [[Michael L. Littman]], [[Sergiu Goschin]] ('''2013'''). ''[http://proceedings.mlr.press/v24/weinstein12a.html Rollout-based Game-tree Search Outprunes Traditional Alpha-beta]''. [http://proceedings.mlr.press/ PMLR], Vol. 24 » [[Ari Weinstein#FSSS-Minimax|FSSS-Minimax]]
 
* [[Jr-Chang Chen]], [[I-Chen Wu]], [[Wen-Jie Tseng]], [[Bo-Han Lin]], [[Chia-Hui Chang]] ('''2015'''). ''[https://ir.nctu.edu.tw/handle/11536/124541 Job-Level Alpha-Beta Search]''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 7, No. 1
 
* [[Jr-Chang Chen]], [[I-Chen Wu]], [[Wen-Jie Tseng]], [[Bo-Han Lin]], [[Chia-Hui Chang]] ('''2015'''). ''[https://ir.nctu.edu.tw/handle/11536/124541 Job-Level Alpha-Beta Search]''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 7, No. 1
 
* [[Tom Everitt]], [[Marcus Hutter]] ('''2015'''). ''Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search''. Australasian Conference on Artificial Intelligence, [https://pdfs.semanticscholar.org/1b4b/c878b2d068214e39b258ee250e5b8889e84c.pdf pdf]
 
* [[Tom Everitt]], [[Marcus Hutter]] ('''2015'''). ''Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search''. Australasian Conference on Artificial Intelligence, [https://pdfs.semanticscholar.org/1b4b/c878b2d068214e39b258ee250e5b8889e84c.pdf pdf]
 
* [[Tom Everitt]], [[Marcus Hutter]] ('''2015'''). ''Analytical Results on the BFS vs. DFS Algorithm Selection Problem: Part II: Graph Search''. Australasian Conference on Artificial Intelligence
 
* [[Tom Everitt]], [[Marcus Hutter]] ('''2015'''). ''Analytical Results on the BFS vs. DFS Algorithm Selection Problem: Part II: Graph Search''. Australasian Conference on Artificial Intelligence
 +
* [[Alex Fukunaga]], [[Adi Botea]], [[Yuu Jinnai]], [[Akihiro Kishimoto]] ('''2017'''). ''A Survey of Parallel A*''. [https://arxiv.org/abs/1708.05296 arXiv:1708.05296]
 +
==2020 ...==
 +
* [[Quentin Cohen-Solal]] ('''2021'''). ''Completeness of Unbounded Best-First Game Algorithms''. [https://arxiv.org/abs/2109.09468  arXiv:2109.09468]
  
 
=Forum Posts=  
 
=Forum Posts=  
Line 79: Line 84:
 
=External Links=  
 
=External Links=  
 
* [https://en.wikipedia.org/wiki/Best-first_search Best-first search from Wikipedia]
 
* [https://en.wikipedia.org/wiki/Best-first_search Best-first search from Wikipedia]
* [[:Category:Gunter Hampel|Gunter Hampel]] Group + [[:Category:Jeanne Lee|Jeanne Lee]] - [https://www.discogs.com/de/Gunter-Hampel-Group-Jeanne-Lee-Gunter-Hampel-Group-Jeanne-Lee/release/2679253 The Capacity of this Room] (1969), [https://en.wikipedia.org/wiki/YouTube YouTube] Video
+
* [[:Category:Ian Carr|Ian Carr]] & [[:Category:Nucleus|Nucleus]] - Sidewalk, live at the [https://en.wikipedia.org/wiki/BBC BBC 1980], [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: [https://de.wikipedia.org/wiki/Arjen_Gorter Arjen Gorter], [[:Category:Willem Breuker|Willem Breuker]], [[:Category:Pierre Courbois|Pierre Courbois]], [[:Category:Gunter Hampel|Gunter Hampel]], [[:Category:Jeanne Lee|Jeanne Lee]]
+
: feat.: [[:Category:Allan Holdsworth|Allan Holdsworth]], [https://en.wikipedia.org/wiki/Brian_Smith_(musician) Brian Smith], [https://de.wikipedia.org/wiki/Tim_Whitehead Tim Whitehead], [https://de.wikipedia.org/wiki/Geoff_Castle Geoff Castle], [https://en.wikipedia.org/wiki/Chucho_Merch%C3%A1n Chucho Merchán], [https://de.wikipedia.org/wiki/Nic_France Nic France], [https://www.allmusic.com/artist/chris-fletcher-mn0000384453/credits Chris Fletcher]
: {{#evu:https://www.youtube.com/watch?v=jfAFeVVo_8Y|alignment=left|valignment=top}}
+
: {{#evu:https://www.youtube.com/watch?v=Bpb_9UE12Gs|alignment=left|valignment=top}}
  
 
=References=  
 
=References=  
 
<references />
 
<references />
 
 
'''[[Search|Up one Level]]'''
 
'''[[Search|Up one Level]]'''
[[Category:Willem Breuker]]
+
[[Category:Nucleus]]
[[Category:Pierre Courbois]]
+
[[Category:Ian Carr]]
[[Category:Gunter Hampel]]
+
[[Category:Allan Holdsworth]]
[[Category:Jeanne Lee]]
 

Latest revision as of 13:42, 18 November 2021

Home * Search * Best-First

Breadth-First Node order [1]

Best-First Search is a state space search to traverse nodes of tree-like data structures (i. e. search trees) in breadth-first manner. It is usually implemented with a priority queue instead of the FIFO of breadth-first [2] , to expand the most promising node of one level first. Best-first turns a uninformed breadth-first into an informed search. Since all nodes of one level must be saved until their child nodes at the next level have been generated, the space complexity and memory requirement is proportional to the number of nodes at the deepest level.

Best-first algorithms like A* are used for path finding in combinatorial search and puzzles. Iterative deepening is a technique to turn depth-first searches into best-first with the advantage space grows linear rather than exponential with increasing search depth [3], as applied for instance in IDA*.

Two-Player

Following best-first algorithms were invented and implemented for computer chess programs as well for other two-player zero-sum board game players with perfect information:

Some Chess Programs

See also

Publications

1960 ...

1970 ...

1980 ...

1990 ...

2000 ...

2010 ...

2020 ...

Forum Posts

External Links

feat.: Allan Holdsworth, Brian Smith, Tim Whitehead, Geoff Castle, Chucho Merchán, Nic France, Chris Fletcher

References

Up one Level