ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Computer-based estimation of the difficulty of chess tactical problems

Simon Stoiljkovikj (2015) Computer-based estimation of the difficulty of chess tactical problems. EngD thesis.

Download (1220Kb)


    In intelligent tutoring systems, it is important for the system to understand how difficult a problem is for the student. However, it is an open question how to automatically assess such difficulty. The aim of our research is to find formalized measures of difficulty that could be used in automated assessment of the difficulty of a mental task for a human. We present a computational approach to estimating the difficulty of problems in which the difficulty arises from the combinatorial complexity of problems where a search among alternatives is required. Our approach is based on a computer heuristic search for building search trees that are “meaningful” from a human's point of view. We demonstrate that by analyzing properties of such trees, the program is capable to predict how difficult it would be for a human to solve the problem. In the experiments with chess tactical problems our program was able to differentiate between easy and difficult problems with a high level of accuracy.

    Item Type: Thesis (EngD thesis)
    Keywords: task difficulty, human problem solving, heuristic search, search trees, chess tactical problems
    Number of Pages: 51
    Language of Content: English
    Mentor / Comentors:
    Name and SurnameIDFunction
    doc. dr. Matej Guid937Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536257987)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 2935
    Date Deposited: 27 Feb 2015 14:57
    Last Modified: 31 Mar 2015 13:24
    URI: http://eprints.fri.uni-lj.si/id/eprint/2935

    Actions (login required)

    View Item