Alfa-beta pretraga (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Alfa-beta pretraga" in Serbian language version.

refsWebsite

Global rank Serbian rank

3web.archive.org

1^st place

2doi.org

2^nd place

4^th place

2stanford.edu

179^th place

200^th place

1berkeley.edu

580^th place

551^st place

1webcitation.org

24^th place

56^th place

1computerhistory.org

2,213^th place

2,228^th place

1handle.net

102^nd place

266^th place

1kotok.org

low place

1ualberta.ca

3,600^th place

5,793^rd place

1fileserve.com

low place

1worldcat.org

5^th place

12^th place

1acm.org

1,185^th place

1,193^rd place

acm.org

dl.acm.org

Abramson, Bruce (1989). „Control Strategies for Two-Player Games”. ACM Computing Surveys. 21 (2): 137. doi:10.1145/66443.66444. Приступљено 20. 8. 2008.

berkeley.edu

aima.cs.berkeley.edu

Russell, Stuart J.; Norvig, Peter (2010). Artificial Intelligence: A Modern Approach (3rd изд.). Upper Saddle River, New Jersey: Pearson Education, Inc. стр. 167. ISBN 978-0-13-604259-4..

computerhistory.org

archive.computerhistory.org

Newell, Allen & Herbert A. Simon (1976). „Computer Science as Empirical Inquiry: Symbols and Search” (PDF). Communications of the ACM. 19 (3). Архивирано из оригинала (PDF) 28. 06. 2007. г. Приступљено 21. 12. 2006.

doi.org

* Knuth, D. E. & Moore, R. W. (1975). „An Analysis of Alpha–Beta Pruning” (PDF). Artificial Intelligence. 6 (4): 293—326. doi:10.1016/0004-3702(75)90019-3. ^{[мртва веза]}
- Reprinted as Chapter 9 in Knuth, Donald E. (2000). Selected Papers on Analysis of Algorithms. Stanford, California: Center for the Study of Language and Information - CSLI Lecture Notes, no. 102. OCLC 222512366. 1-57586-212-3. Архивирано из оригинала 01. 12. 2010. г. Приступљено 30. 05. 2013.
- Abramson, Bruce (1989). „Control Strategies for Two-Player Games”. ACM Computing Surveys. 21 (2): 137. doi:10.1145/66443.66444. Приступљено 20. 8. 2008.

fileserve.com

* Knuth, D. E. & Moore, R. W. (1975). „An Analysis of Alpha–Beta Pruning” (PDF). Artificial Intelligence. 6 (4): 293—326. doi:10.1016/0004-3702(75)90019-3. ^{[мртва веза]}
- Reprinted as Chapter 9 in Knuth, Donald E. (2000). Selected Papers on Analysis of Algorithms. Stanford, California: Center for the Study of Language and Information - CSLI Lecture Notes, no. 102. OCLC 222512366. 1-57586-212-3. Архивирано из оригинала 01. 12. 2010. г. Приступљено 30. 05. 2013.

handle.net

hdl.handle.net

Edwards, D.J. & Hart, T.P. (4. 12. 1961). „The Alpha–beta Heuristic (AIM-030)”. Massachusetts Institute of Technology. Приступљено 21. 12. 2006.

kotok.org

Kotok, Alan (3. 12. 2004). „MIT Artificial Intelligence Memo 41”. Архивирано из оригинала 06. 11. 2020. г. Приступљено 1. 7. 2006.

stanford.edu

www-formal.stanford.edu

McCarthy, John (27. 2. 2006). „Human Level AI Is Harder Than It Seemed in 1955”. Приступљено 20. 12. 2006.

www-cs-faculty.stanford.edu

* Knuth, D. E. & Moore, R. W. (1975). „An Analysis of Alpha–Beta Pruning” (PDF). Artificial Intelligence. 6 (4): 293—326. doi:10.1016/0004-3702(75)90019-3. ^{[мртва веза]}
- Reprinted as Chapter 9 in Knuth, Donald E. (2000). Selected Papers on Analysis of Algorithms. Stanford, California: Center for the Study of Language and Information - CSLI Lecture Notes, no. 102. OCLC 222512366. 1-57586-212-3. Архивирано из оригинала 01. 12. 2010. г. Приступљено 30. 05. 2013.

ualberta.ca

cs.ualberta.ca

Marsland, T.A. (1987). „Computer Chess Methods (PDF) from Encyclopedia of Artificial Intelligence. S. Shapiro (editor)” (PDF). J. Wiley & Sons. стр. 159—171. Архивирано из оригинала (PDF) 6. 9. 2003. г. Приступљено 21. 12. 2006.

web.archive.org

Kotok, Alan (3. 12. 2004). „MIT Artificial Intelligence Memo 41”. Архивирано из оригинала 06. 11. 2020. г. Приступљено 1. 7. 2006.
Marsland, T.A. (1987). „Computer Chess Methods (PDF) from Encyclopedia of Artificial Intelligence. S. Shapiro (editor)” (PDF). J. Wiley & Sons. стр. 159—171. Архивирано из оригинала (PDF) 6. 9. 2003. г. Приступљено 21. 12. 2006.
* Knuth, D. E. & Moore, R. W. (1975). „An Analysis of Alpha–Beta Pruning” (PDF). Artificial Intelligence. 6 (4): 293—326. doi:10.1016/0004-3702(75)90019-3. ^{[мртва веза]}
- Reprinted as Chapter 9 in Knuth, Donald E. (2000). Selected Papers on Analysis of Algorithms. Stanford, California: Center for the Study of Language and Information - CSLI Lecture Notes, no. 102. OCLC 222512366. 1-57586-212-3. Архивирано из оригинала 01. 12. 2010. г. Приступљено 30. 05. 2013.

webcitation.org

Newell, Allen & Herbert A. Simon (1976). „Computer Science as Empirical Inquiry: Symbols and Search” (PDF). Communications of the ACM. 19 (3). Архивирано из оригинала (PDF) 28. 06. 2007. г. Приступљено 21. 12. 2006.

worldcat.org

* Knuth, D. E. & Moore, R. W. (1975). „An Analysis of Alpha–Beta Pruning” (PDF). Artificial Intelligence. 6 (4): 293—326. doi:10.1016/0004-3702(75)90019-3. ^{[мртва веза]}
- Reprinted as Chapter 9 in Knuth, Donald E. (2000). Selected Papers on Analysis of Algorithms. Stanford, California: Center for the Study of Language and Information - CSLI Lecture Notes, no. 102. OCLC 222512366. 1-57586-212-3. Архивирано из оригинала 01. 12. 2010. г. Приступљено 30. 05. 2013.