Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Jurnal Ilmiah Matrik
R. Kristoforus J. Bendi
Universitas Katolik Musi Charitas
Computer Science & IT

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
SIMULATED ANNEALING APPROACH FOR UNIVERSITY TIMETABLE PROBLEM R. Kristoforus J. Bendi; Hadi Junaidi
Jurnal Ilmiah Matrik Vol 21 No 3 (2019): Jurnal Ilmiah Matrik
Publisher : Direktorat Riset dan Pengabdian Pada Masyarakat (DRPM) Universitas Bina Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1298.367 KB) | DOI: 10.33557/jurnalmatrik.v21i3.723

Abstract

Abstract : University Scheduling is a way of allocating students, lecturers, and rooms, which is used for lectures in the available time slots. The common problems are that a lecturer is scheduled in the same time slot, or several courses are scheduled in the same room and the same time slot. For this reason, scheduling needs to be made in such a way that it can optimize the use of resources. We use simulated annealing as an approach to solve that problem. The results showed that the higher the initial temperature value used and the greater the iteration value would reduce the violation constraints in scheduling problems.
DESAIN NON-PLAYER CHARACTER PERMAINAN TIC-TAC-TOE DENGAN ALGORITMA MINIMAX Gunadi Emanuel; R. Kristoforus J. Bendi; Arieffianto Arieffianto
Jurnal Ilmiah Matrik Vol 21 No 3 (2019): Jurnal Ilmiah Matrik
Publisher : Direktorat Riset dan Pengabdian Pada Masyarakat (DRPM) Universitas Bina Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1145.684 KB) | DOI: 10.33557/jurnalmatrik.v21i3.725

Abstract

Abstract : Tic-Tac-Toe is one of the board games. It is played by filling the columns on the board with X or O in such a way as to form parallel lines vertically, horizontally and diagonally. This study aims to design Non-Player Characters (NPC) in the tic-tac-toe game with the minimax algorithm. The Tic-tac-toe game will be designed with two game modes: easy and minimum random modes. While in minimax NPC mode will determine the best step. The game development process of the tic-tac-toe application is based on a linear sequence process model. In the analysis phase, the NPC will be designed based on the concept of minimax. Software modeling was designed using Unified Modeling Language (UML), and coded with Visual Basic programming. Our tests show that NPCs with the Minimax algorithm can work well.
Co-Authors Arieffianto Arieffianto Gunadi Emanuel Hadi Junaidi