Permainan Catur Harimau Menggunakan Algoritma Negamax Pada Platform Android

65

DAFTAR PUSTAKA

Abt, C. C. 1987. Serious Games. University Press of America, Inc.: Boston.

Borouska, P. & Lazanova, M. 2007. Efficiency Of Parallel Minimax Algorithm For
Game Tree Search. International Conference On Computer System And
Technologies – CompSysTech, pp. 6-14.
Carolus, J. W. T. 2006. Alpha-Beta with Sibling Prediction Pruning in Chess. Thesis.
University of Amsterdam Netherlands.

Coppin, B. 2004. Artificial Intelligence Illuminated. Jones and Bartlett Publishers,
Inc.: Sudbury.

Departemen Pendidikan dan Kebudayaan. 1980. Permainan Rakyat Daerah Sumatera
Barat. Departemen Pendidikan Dan Kebudayaan Proyek Inventarisasi Dan
Dokumentasi Kebudayaan Daerah Sumatera Barat: Sumatera Barat.

Diez, S. G., Laforge, J. & Saerens, M. 2012. An Optimally Randomized Minimax
Algorithm. Cyber Nostics, IEEE Transactions on 43(1): 385-393.


Elnaggar, A. A., et al. 2014. A Comparative Study of Game Tree Searching Methods.
International Journal of Advanced Computer Science and Applications 5(5):
68-77.

James, D. 2013. Android Game Programming For Dummies. John Wiley & Sons,
Inc.: New Jersey.
Lim, Y. J. & Lee, W. S. 2006. RankCut – A Domain Independent Forward Pruning
Method for Games. Proceedings of the National Conference on Artificial
Intelligence 21(2): 1026.

Universitas Sumatera Utara

66

Mandziuk, J., Kusiak, M. & Waledzik, K. 2007. Evolutionary-based heuristic
generators for checkers and give-away checkers. ExpertSystem 24(4): 189-211

Millington, I. 2006. Artificial Intelligence For Games. Morgan Kaufmann Publishers
is an imprint of Elsevier: San Fransisco.


Moriarty, D. E. & Miikkulainen, R. 1995. Discovering Complex Othello Strategies
Through Evolutionary Neural Networks. Connection Science 7(3): 195-209

Nurjannah. 2010. Analisis dan Implementasi Algoritma Minimax dengan Optimasi
Alpha Betha Prunning pada permainan Five In Row. Skripsi. Ilmu Komputer
Universitas Sumatera Utara

Octavianus, K., Octavia, T. & Willy, W. 2015. Penerapan Algoritme Negamax dan
Alpha Beta Pruning Pada Permainan Catur 3D Berbasis Desktop. Jurnal.
STMIK GI MDP.

Plaat, A., et al. 1995. Bets-First and Depth-First Minimax Search in Practice.
Fourteenth International Joint Conference on Artificial Intelligence: 273-279.

Rogers, R. 2011. Learning Android Game Programing. Pearson Education, Inc.:
United States.

Shunhua, T. & Miao, C. 2012. Search Algorithm in the Five-piece Chess. Journal of
Emerging Trends in Computing and Information Sciences 3(4): 596-599.


Tabibi, O. D., Koppel, M. & Netanyahu, N. S. 2010. Optimizing Selective Search in
Chess. Proceedings of the International Conference on Machine Learning
(ICML) Workshop on Machine Learning and Games, Haifa, Israel, June 2010.

Universitas Sumatera Utara

67

Tabibi, O. D. & Netanyahu, N. S. 2008. Extended Null-Move Reductions.
Proceedings of the 2008 International Conference on Computers and Games,
pp. 205-216.

Tabibi, O. D. & Netanyahu, N. S. 2008. Verified Null-Move Pruning. Journal ref:
ICGA Journal, International Computer Games Association 25(3): 153-161.
Timothy, R. G. 2014. Implementasi Algortima Minimax dan optimasi Alpha Beta
pada permainan Catur. Skripsi. Universitas Multimedia Nusantara.

Universitas Sumatera Utara