Artificial Intelligence Techniques for Chess Puzzle Generation and Automated Evaluation
| dc.contributor.author | Louahem M’sabah ,Mohamed Akram | |
| dc.contributor.author | Mokhtari ,Rezkallah | |
| dc.contributor.author | Touil, Ghassen | |
| dc.date.accessioned | 2026-11-02T08:35:13Z | |
| dc.date.available | 2026-11-02T08:35:13Z | |
| dc.date.issued | 2026 | |
| dc.description.abstract | Chess puzzles are a central tool for developing tactical skill, yet assembling large, high-quality collections by hand does not scale, and the difficulty of a newly created puzzle cannot be known until many players have attempted it. This dissertation addresses both problems through an automated, engine-based pipeline for generating and evaluating tactical chess puzzles. The system keeps generation separate from evaluation: candidate positions are obtained either by extracting them from real games in PGN form or by applying small, legal perturbations to seed positions, and every candidate then passes through the same verification and scoring stages. Verification combines a legality check, a shallow plausibility screen, and a recursive onlymove test that drives the Stockfish 16 engine with a two-line (MultiPV) search to confirm that the solution is forced and uniquely best at each move. Accepted puzzles are scored for uniqueness margin, counter-intuitiveness, novelty, and diversity, and are assigned a difficulty rating without any solving history, using a transparent heuristic together with an optional learned model built on thirteen history-free features. The pipeline is implemented as Tactica, a self-contained client-side web application built with React, chess.js, and a single-threaded WebAssembly build of Stockfish, in which puzzles are generated, solved, and stored entirely in the browser. The implementation is backed by thirty-eight automated tests, all passing, and by a measured generation run on the Lichess Elite database. The learned difficulty model, trained and tested on real Lichess puzzle ratings, reaches a mean absolute error of about 309 rating points and a Pearson correlation of about 0.72 with human difficulty, clearly outperforming both baselines. The main contribution is a reproducible, fully engine-based framework that unifies puzzle generation, soundness and uniqueness verification, and historyfree difficulty estimation. | |
| dc.identifier.uri | http://dspace.univ-skikda.dz:4000/handle/123456789/6536 | |
| dc.language.iso | en | |
| dc.publisher | Faculty of Science | |
| dc.title | Artificial Intelligence Techniques for Chess Puzzle Generation and Automated Evaluation | |
| dc.title.alternative | Artificial Intelligence | |
| dc.type | Thesis |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- Louahem M’sabah Mohamed Akram_AddPage.pdf
- Size:
- 8.07 MB
- Format:
- Adobe Portable Document Format
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed to upon submission
- Description: