cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Kurniawan Dwi Irianto
Contact Email
k.d.irianto@uii.ac.id
Phone
+6285879299649
Journal Mail Official
k.d.irianto@uii.ac.id
Editorial Address
Jl. Kaliurang Km 14,5, Sleman, Yogyakarta Gedung KH. Mas Masyur, Fakultas Teknologi Industri, Universitas Islam Indonesia
Location
Kab. sleman,
Daerah istimewa yogyakarta
INDONESIA
Jurnal Sains, Nalar, dan Aplikasi Teknologi Informasi
Published by Universitas Islam Indonesia
ISSN : -     EISSN : 28075935     DOI : 10.20885/snati
Core Subject : Science,
Computer Science & IT
Jurnal SNATi publishes original research articles on various topics related to computer science, information technology, systems engineering, and complementary fields.
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 61 Documents
 3   4   5   6   7 
Clustering Analysis of Chess Portable Game Notation Text Wijayanto, Feri
Jurnal Sains, Nalar, dan Aplikasi Teknologi Informasi Vol. 3 No. 3 (2024)
Publisher : Department of Informatics Universitas Islam Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20885/snati.v3.i3.42

Abstract

Chess is a game that requires a high level of intelligence and strategy. Generally, in order to understand complex move patterns and strategies, the expertise of chess masters is required. With the rapid development in the field of machine learning, the digitization of chess game recordings in Portable Game Notation (PGN) format, and the availability of large and widely accessible data, it is possible to apply machine learning techniques to analyze chess games. This research studies the use of text clustering algorithms, specifically hierarchical clustering and K-means clustering, to categorize chess games based on their moves. We extracted 100 chess games that use certain openings such as French Defence, Queen's Gambit Declined, and English Opening. In the implementation of hierarchical clustering, single, average, and complete linkage methods are used. As a result, our findings show that hierarchical clustering with single linkage is less effective. On the other hand, the average and complete linkage methods, as well as K-means clustering, successfully identify clusters corresponding to the original openings. Notably, K-means clustering showed the highest accuracy in clustering chess games. This research highlights the potential of machine learning techniques in uncovering strategic patterns in chess games, paving the way for deeper insights into game strategies.

Page 7 of 7 | Total Record : 61

 3   4   5   6   7 

Filter by Year

2021 2025


Reset
Filter By Issues
All Issue Vol. 4 No. 2 (2025) Vol. 4 No. 1 (2025) Vol. 3 No. 3 (2024) Vol. 3 No. 2 (2024) Vol. 3 No. 1 (2023) Vol. 2 No. 2 (2023) Vol. 2 No. 1 (2022) Vol. 1 No. 2 (2022) Vol. 1 No. 1 (2021)