Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Cloud Information

SISTEM PENUNJANG KEPUTUSAN PESERTA KURSUS UPTD BLK KAB. KUNINGAN DENGAN METODE PROFILE MATCHING BERBASIS WEB Panji Novantara
Cloud Information Vol 3, No 2 (2018)
Publisher : Sistem Informasi Fakultas Ilmu Komputer Universitas Kuningan

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In accordance with the regulations set by the government in the process of graduation of course, needs criteria for determining the graduation of participants, especially in vocational information and communication technologies in the sub department office tools. In the process of determining graduation at UPTD BLK Kuningan, it needs a decision support system. One method that can be used for decision support system is using the Profile Matching. This method is chosen because it is able to select the best candidates from a number of course participants in Kuningan District, determining graduation course participants of UPTD BLK for assessment in determining the graduation, in this case the participants meant that the weight value for each attribute, such as aspects of intelligence and aspects of the work attitude, then it is conducted ranking process that will determine the optimal alternative, in this case is the best course participants.Keywords : SPK, Graduation Course Participants, Profile Matching Method
RANCANG BANGUN APLIKASI CATUR MENGGUNAKAN ALGORITMA MINIMAX DENGAN OPTIMASI ALPHA-BETA PRUNING Panji Novantara
Cloud Information Vol 3, No 1 (2017)
Publisher : Sistem Informasi Fakultas Ilmu Komputer Universitas Kuningan

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

ABSTRACT Chess is a strategy game which is played in turns. This game has been around since ancient times. In the game of chess, it requires strategy or a good way to win a game. It is one of sports that many people played. Almost everyone knows the game of chess, although some of them do not know the steps of the chess pieces. To determine a good movement in chess, we need an algorithm, one of them is the Alpha-Beta Pruning algorithm. Alpha-Beta Pruning is the development of MiniMax algorithm which is one of the searching algorithm to determine the maximum and minimum values by cutting unnecessary nodes. In this study, the writer makes an application chess game that anyone can play chess on an electronic device, especially PC, while the algorithm used is Alpha-Beta Pruning (specify the steps taken by the computer) with a software development method that is chosen is the Rational Unified Process (RUP ). In the process of implementing, these algorithms needs a method called evaluation board, in which each chess piece has a respective value of 0 is king, queen 900, 300 elephants, 300 horses, castle 500 and pawns 100. The results of this paper is the use of an algorithm Alpha-Beta Pruning in this chess game that the computer can respond to the steps taken by the users quickly.  Keywords : Chess, Minimax, Alpha-Beta Pruning, Node, RUP