Razvoj šahovskega programa z uporabo različnih tehnik in hevristik

This thesis presents the overall design, along with different algorithms, heuristics, and methods used to develop FRIChallenger, a strong competitive chess engine. During the development of the engine, the process of creating the move generator is explained, responsible for generating all legal moves in a given position. Then, with the help of algorithms (e.g., alpha-beta pruning, quiescence search, iterative deepening, and other alpha-beta selective enhancements), a selective search is created that explores only the most promising paths in the search tree. Using an extensive evaluation function, a position is evaluated to determine whether it is better for the White or Black side and by what margin. Finally, the engine’s performance was tested against other established engines using the CuteChess program, and the results indicate that the final implementation reaches a playing strength of approximately 2500 Elo.

Authors

Publication Details

Journal
Repository of the University of Ljubljana (University of Ljubljana)
Published
2026-04-20
Primary Topic
Artificial Intelligence in Games
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Razvoj šahovskega programa z uporabo različnih tehnik in hevristik

Nikola Simjanovski
Repository of the University of Ljubljana (University of Ljubljana)
Artificial Intelligence in Games
article

Razvoj šahovskega programa z uporabo različnih tehnik in hevristik

Nikola Simjanovski
article en

Abstract

This thesis presents the overall design, along with different algorithms, heuristics, and methods used to develop FRIChallenger, a strong competitive chess engine. During the development of the engine, the process of creating the move generator is explained, responsible for generating all legal moves in a given position. Then, with the help of algorithms (e.g., alpha-beta pruning, quiescence search, iterative deepening, and other alpha-beta selective enhancements), a selective search is created that explores only the most promising paths in the search tree. Using an extensive evaluation function, a position is evaluated to determine whether it is better for the White or Black side and by what margin. Finally, the engine’s performance was tested against other established engines using the CuteChess program, and the results indicate that the final implementation reaches a playing strength of approximately 2500 Elo.

Repository of the University of Ljubljana (University of Ljubljana)
Peace, Justice and strong institutions
Openalex Percentile: Top 3%
Artificial Intelligence in Games
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.