<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.uni-lj.si/IzpisGradiva.php?id=121985"><dc:title>Automatic recognition of similar chess motifs</dc:title><dc:creator>Bizjak,	Miha	(Avtor)
	</dc:creator><dc:creator>Guid,	Matej	(Mentor)
	</dc:creator><dc:subject>problem solving</dc:subject><dc:subject>chess</dc:subject><dc:subject>chess motifs</dc:subject><dc:subject>automatic similarity recognition</dc:subject><dc:subject>information retrieval</dc:subject><dc:subject>query by example</dc:subject><dc:description>We present a novel method for retrieval of chess positions similar to a given query position from a collection of archived chess games. Our approach considers not only the static similarity due to the arrangement of the chess pieces, but also the dynamic similarity based on the recognition of chess motifs and dynamic, tactical aspects of position similarity. We use information retrieval techniques to enable efficient approximate searches by encoding chess tactical problems as text documents. In addition, we designed and implemented a procedure for automatic generation of tactical puzzles from a collection of chess games.

We have shown experimentally how important the inclusion of both static and dynamic features is for successful detection of similar chess motifs. In another experiment, the program was able to quickly traverse a large database of positions to identify similar tactical problems. A chess expert found the resulting program useful for automatically generating instructive examples for chess training.</dc:description><dc:date>2020</dc:date><dc:date>2020-11-13 11:50:00</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>121985</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
