izpis_h1_title_alt

Computer-based estimation of the difficulty of chess tactical problems : bachelor's thesis
Stoiljkovikj, Simon (Author), Guid, Matej (Mentor) More about this mentor... This link opens in a new window

URLURL - Presentation file, Visit http://eprints.fri.uni-lj.si/2935/ New window

Abstract
Pri inteligentnih tutorskih sistemih je pomembno, da sistem razume, kako težak je določen problem za učenca. Kako samodejno oceniti tovrstno težavnost, ostaja odprto vprašanje. Namen raziskave je razviti algoritmičen pristop k ugotavljanju težavnosti, ki bi ga lahko uporabljali pri avtomatiziranem ocenjevanju težavnosti problemov za človeka. Osredotočili se bomo na ocenjevanje težavnosti problemov, pri katerih težavnost izvira iz kombinatorične kompleksnosti in kjer je potrebno preiskovanje med alternativami. Pristop temelji na uporabi hevrističnega računalniškega preiskovanja za gradnjo preiskovalnih dreves, ki so ``smiselna'' z vidika osebe, ki problem rešuje. Pokazali bomo, da je s pomočjo analize lastnosti tovrstnih ``smiselnih'' dreves računalniški program sposoben napovedati, kako težak za reševanje je določen problem. Naš program je bil sposoben z visoko stopnjo natančnosti ločevati med enostavnimi in težkimi šahovskimi taktičnimi problemi.

Language:English
Keywords:task difficulty, human problem solving, heuristic search, search trees, chess tactical problems, computer science, computer and information science, diploma
Work type:Bachelor thesis/paper (mb11)
Tipology:2.11 - Undergraduate Thesis
Organization:FRI - Faculty of computer and information science
Year:2015
Publisher:[S. Stoiljkovikj]
Number of pages:51 str.
UDC:004.85(043.2)
COBISS.SI-ID:1536257987 Link is opened in a new window
Views:450
Downloads:232
Metadata:XML RDF-CHPDL DC-XML DC-RDF
 
Average score:(0 votes)
Your score:Voting is allowed only to logged in users.
:
Share: Bookmark and Share

Secondary language

Language:Slovenian
Title:Computer-based estimation of the difficulty of chess tactical problems
Abstract:
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.

Keywords:težavnost problema, človeško reševanje problemov, hevristično preiskovanje, preiskovalna drevesa, šahovski taktični problemi, računalništvo, računalništvo in informatika, univerzitetni študij, diplomske naloge

Similar documents

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

Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back