Details

Program za analiziranje šahovskih pozicij
ID Hribar, Žan (Author), ID Sadikov, Aleksander (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (645,79 KB)
MD5: E8137FAE05F5A23F71FCC364629DB25F

Abstract
Predstavili bomo potek izdelave programa za analiziranje šahovskih pozicij. V zadnjih nekaj desetletjih se je nivo šahovske teorije in taktike močno zvišal. Velik razlog za ta napredek so programi za analiziranje šahovskih pozicij. Predstavili bomo različne predstavitve figur in pozicij v računalniškem šahu ter kaj uporabljajo moderni programi. Nato se bomo obrnili na način generiranja potez. Nadaljevali bomo z prikazom načina igranja in izničevanja potez. Obdelali bomo različne iskalne algoritme in njihovo uporabo. Predstavili bomo različne hevristike za ocenjevanje pozicij. Obrnili se bomo tudi na nekatere iskalne optimizacije, ki pohitrijo delovanje programa. Pokazali bomo tudi vmesnik komunikacije, ki ga uporabljajo programi za analiziranje šahovskih pozicij za medsebojno komunikacijo. Prikazali bomo rezultate testov, ki prikazujejo, da je naš program primerljiv s programom Stockfish 18 omejen na 2300 moči.

Language:Slovenian
Keywords:Šah, Program za analiziranje šahovskih pozicij, Negamax, Hevristike, Iskalne optimizacije
Work type:Bachelor thesis/paper
Typology:2.11 - Undergraduate Thesis
Organization:FRI - Faculty of Computer and Information Science
Year:2026
PID:20.500.12556/RUL-187034 This link opens in a new window
COBISS.SI-ID:291408643 This link opens in a new window
Publication date in RUL:08.09.2026
Views:174
Downloads:64
Metadata:XML DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Secondary language

Language:English
Title:A chess analysis program
Abstract:
We will present the development process of a chess engine. Over the last few decades, the level of chess theory and tactics has increased significantly. A major reason for this progress are chess engines. We will present different representations of pieces and positions in computer chess and what modern programs use. We will then turn to the method of move generation. We will continue by presenting the methods of making and unmaking moves. We will discuss various search algorithms and their use. We will present different heuristics for evaluating positions. We will also discuss some search optimizations that speed up the program. We will also show the communication interface used by chess engines and other programs for communication with one another. We will present the results of tests showing that our program is comparable to Stockfish 18 limited to a playing strength of 2300.

Keywords:Chess, Chess engine, Negamax, Heuristics, Search optimizations

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back