Permainan Strategi Battleship Menggunakan Backtracking Dan Depth First Search

Teguh Saputra, Yohanes Aryo Bismo Raharjo

Abstract


Battleship is a board game. It can be play by shooting empty boxes on the game board until player or computer (AI) win. The purpose of this research is to create a computer-based battleship game that has Artificial Intelligence (AI) so this game does not require two people to play. Besides not requiring two people to play, players can also enjoy this battleship game with artificial intelligence (AI) which is equipped with algorithms. The algorithm to make this battleship game is by using two algorithm backtracking and DFS. This application is to allow players run this application with an algorithm, that is equipped with a search for the player ship and the player can play the game without placing their ship first.  The description of this battleship game is like a destructive game, but the theme taken in making this application is whether the search for a the player ship using the backtracking and DFS algorithm is a incredibly efficient algorithm in this battleship game application. This battleship game application is made by using the waterfall method with Unified Modeling Language (UML) and python programming. The results of this research is a battleship games that have artificial intelligence (AI) that can be adapted to the player's ability, so that it can be used as an entertainment. Other than as an entertainment this application should be developed with more attractive features.

Keywords


Battleship; Artificial Intelligence; Backtracking; DFS

Full Text:

PDF

References


Munir, Rinaldi. (2009) Diktat Kuliah IF 2251 Strategi Algoritmik. Program Studi Teknik Informatika, Sekolah Teknik Elektro dan Informatika, Institut Teknologi Bandung.

Sumarsono, Abraham Ranardo. (2009). Penerapan Algortima Runut Balik dalam Pencarian Solusi Teka Teki Battleship. Institut Teknologi Bandung.

Oktavianto, H. (2016). Perancangan Aplikasi Permainan Strategi Battle Ship Menggunakan VB. NET. INTEKSIS, 1(1).

Teneng, T., Purwadi, J., & Kurniawan, E. (2011). Penerapan Algoritma Backtracking Pada Permainan Math Maze. Jurnal Informatika, 6(2).

Fahrudin, B. (2016). Penerapan Algoritma Backtracking Pada Permainan Capsa Banting. JURIKOM (Jurnal Riset Komputer), 3(6).

Roger.S, 2011. Software Engineering : A Practioner's Approach. 5th .McGrawHill.

Haviluddin. 2011. Memahami Penggunaan UML. Unified Modelling Language. Jurnal Informartika Mulawarman. Vol 6 No.1 Februari 2011. Samarinda.

Nugroho, Adi, 2010, Rekayasa Perangkat Lunak Menggunakan UML dan Java, Edisi 1,Andi Publisher, 2010.

Tripathy, A., & Mitra, A. (2013). Test case generation using activity diagram and sequence diagram. In Proceedings of International Conference on Advances in Computing (pp. 121-129). Springer, New Delhi.

Balaji, S., & Murugaiyan, M. S. (2012). Waterfall vs. V-Model vs. Agile: A comparative study on SDLC. International Journal of Information Technology and Business Management, 2(1), 26-30.

Rouf, A. (2012). Pengujian perangkat lunak dengan menggunakan metode white box dan black box. Himsyatech, 8(1).




DOI: http://dx.doi.org/10.30700/.v2i1.867

Article Metrics

Abstract view : 0 times
PDF - 0 times