| References: [1] Buro, M. (1999). Toward Opening Book Learning. ICCA Journal, Vol. 22, No. 2, pp. 98-102. ISSN 0920-234X.
[2] Slate, D. J. (1987). A Chess Program that uses its Transposition Table to Learn from Experience. ICCA Journal, 10 (2) 59-71. ISSN 0920-234X.
[3] Buro, M. (2000). Toward Opening Book Learning. Games in AI Research (eds. H.J. van den Herik and H. IIda), p. 47-54. Universiteit Maastricht, Maastricht, The Netherlands. ISBN 90-621-6416-1.
[4] Hyatt, R. M. (1999). Book Learning - a Methodology to Tune an Opening Book Automatically. ICCA Journal, 22 (1) 3- 12.
[5] Spracklen, K. (1983). Tutorial: Representation of an Opening Tree. ICCA Newsletter, 6 (1) 6-8.
[6] Schaeffer, J., Hlynka, M., Jussila, V. (2001). Temporal Difference Learning Applied to a High-Performance Game-Playing Program. Proceedings International Joint Conference on Artificial Intelligence, p. 529-534.
[7] Baxter, J., Tridgell, A., Weaver, L. (1998). Experiments in Parameter Learning using Temporal Differences. ICCA Journal, 21 (2) 84-99.
[8] Beal, D. F., Smith, M. C. (1999). Learning Piece-Square Values using Temporal Differences. ICCA Journal, 22 (4) 223- 235.
[9] Tesauro, G. (1992). Practical Issues in Temporal Difference Learning. Machine Learning, Vol. 8, p. 257-277. ISSN 0885-6125.
[10] Adelson-Velsky, G., Arlazarov, V., Bitman, A., Zhivotovsky, A., Uskov, A. (1969). Programming a computer to play chess, In: Proceedings of the 1st Summer School on Mathematical Programming, Vol. 2, (1969) p. 216-252.
[11] Donninger, Chr.(1993). Null Move and Deep Search: Selective- Search Heuristics for Obtuse Chess Programs, ICCA Journal, 16 (3) 137-143. ISSN 0920-234X.
[12] Shannon, C. E. (1988). Programming a Computer for Playing Chess, Philosophical Magazine, 41 (7) 256-275. Reprinted (1988) in Computer Games I (ed. D.N.L. Levy), p. 81-88. Springer-Verlag, New York, N.Y. (1950) ISBN 0-387- 96496-7.
[13] Slate, D. J., Atkin, L. R. (1983). CHESS 4.5 – The Northwestern University Chess Program, Chess Skill in Man and Machine (ed. P.W. Frey), p. 82-118. Springer-Verlag, New York, N.Y. 2nd ed. 1983. (1977) ISBN 0-387-90815-3.
[14] Vuckovic, V., Vidanovic, D. (2007). An algorithm for the Detection of Move Repetition Without the use of Hash-Keys, Yugoslav Journal of Operations Research (YUJOR), 17 (2) 257- 274. Belgrade, Serbia. ISSN 0354-0243.
[15] Vuckovic, V. (2006). The Theoretical and Practical Application of the Advanced Chess Algorithms, PhD Theses, The Faculty of Electronic Engineering, The University of Nis, Serbia (2006).
[16] Vuckovic, V. (2001). Axon/Achilles experimental chess engines information could be find at: http://axon.elfak.ni.ac.rs, http://chess.elfak.ni.ac.rs
[17] Zobrist, A. L. (1970). A New Hashing Method with Application for Game Playing. Technical Report #88, Computer Science Department, The University of Wisconsin, Madison, WI, USA. Reprinted (1990) in ICCA Journal, 13 (2) 69-73. ISSN 0920-234X.
[18] Vuckovic, V. (2008). The Compact Chessboard Representation, ICGA Journal, Tilburg, The Netherlands, (September). ISSN 1389-6911. 31 (3) 157 - 164.
[19] Vuckovic, V. (2007). The Method of the Chess Search Algorithms Parallelization using Two-Processor Distributed System”, The Scientific Journal Facta Universitatis, Series Mathematics and Informatics, Niš 2007, ISSN 0352- 9665. 22 (2) 175-188.
[20] Solak, R., Vuckovic, V. (2010). Time Management During a Chess Game, ICGA Journal, Tilburg, The Netherlands, 2010, ISSN 1389-6911. 32 (4) 206- 220.
[21] Vuckovic, V. (2011). Napredni šahovski algoritmi i sistemi, monografija, Zaduzbina Andrejevic, Biblioteka Dissertatio, ISSN 0354-7671, Beograd.
[22] Vuckovic, V. (2007). The Realization of the Parallel Chess System Using UDP Communication Protocol, In: Proceedings of the VIII International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services TELSIKS, Niš, 26-28. (September), Volume 2, p. 450-453. (IEEE Catalog Number: 07EX1875) (ISBN 1-4244-1467-9) |
Author Rights 
