prikaz prve stranice dokumenta Određivanje izvedivih poteza u šahu pomoću bitboard zapisa pozicije
  Download
PDF 690.99 KB
master's thesis
Određivanje izvedivih poteza u šahu pomoću bitboard zapisa pozicije
2017. urn:nbn:hr:200:949891
Kasak, Denis
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Computer Engineering and Automation
Chair of Computer Engineering

Cite this document

Kasak, D. (2017). Određivanje izvedivih poteza u šahu pomoću bitboard zapisa pozicije (Master's thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek. Retrieved from https://urn.nsk.hr/urn:nbn:hr:200:949891

Kasak, Denis. "Određivanje izvedivih poteza u šahu pomoću bitboard zapisa pozicije." Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2017. https://urn.nsk.hr/urn:nbn:hr:200:949891

Kasak, Denis. "Određivanje izvedivih poteza u šahu pomoću bitboard zapisa pozicije." Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2017. https://urn.nsk.hr/urn:nbn:hr:200:949891

Kasak, D. (2017). 'Određivanje izvedivih poteza u šahu pomoću bitboard zapisa pozicije', Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 20 November 2024, https://urn.nsk.hr/urn:nbn:hr:200:949891

Kasak D. Određivanje izvedivih poteza u šahu pomoću bitboard zapisa pozicije [Master's thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2017 [cited 2024 November 20] Available at: https://urn.nsk.hr/urn:nbn:hr:200:949891

D. Kasak, "Određivanje izvedivih poteza u šahu pomoću bitboard zapisa pozicije", Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2017. Available at: https://urn.nsk.hr/urn:nbn:hr:200:949891

Please login to the repository to save this object to your list.
Metadata
TitleOdređivanje izvedivih poteza u šahu pomoću bitboard zapisa pozicije
Title (english)Determination feasible chess moves using bitboard record position
AuthorDenis Kasak
MentorŽeljko Hocenski (mentor)
Committee memberŽeljko Hocenski (predsjednik povjerenstva)
Committee memberIvan Aleksi (član povjerenstva)
Committee memberFilip Sušac (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Computer Engineering and Automation)
(Chair of Computer Engineering)
Osijek
Defense date and country2017-10-03, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Process Computing
Abstract
U ovom radu opisani su kljucni dijelovi i principi rada šahovskih programa koji pretražuju i vrednuju moguce poteze te na temelju toga procjenjuju najbolji potez. Fokus rada je na šahovske programe bazirane na bitboard metodi zapisa pozicije. Promotreni su razliciti algoritmi pretrage poteza te pripadajuce heuristike koje se koriste u modernim šahovskim programima. Opisana je problematika vrednovanja šahovskih pozicija te tehnike koje se koriste pri istoj. U sklopu rada implementiran je šahovski program koji pomocu negamax algoritma s – rezanjem i drugih opisanih tehnika analizira poziciju te procjenjuje najbolji potez. Kao programska podloga korišteno je prethodno razvijeno rješenje koje nudi generator legalnih poteza te graficko sucelje. Na kraju rada programsko rješenje je testirano te su mu izmjerene performanse. Navedeni neki nedostaci i moguca buduca proširenja.
Abstract (english)
The thesis describes key parts and working principles of chess engines, which search and evaluate possible moves in order to give an estimate of the best move. The focus of the thesis were chess engines based on the bitboard method of position encoding. Several different search algorithms and their accompanying heuristics, as used in modern chess engines, were examined. Some common tehniques and considerations when evaluating chess positions were described. A chess engine which estimates the best move using the negamax algorithm with – pruning, and other described techniques, was implemented as part of the thesis. A previously developed solution was used for its GUI and legal move generator as a foundation. Finally, the resultant chess engine was tested and benchmarked. Some shortcomings of the final engine were listed, along with possible improvements in future works.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:949891
Study programmeTitle: Graduate University Study Programme in Computer Engineering
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra inženjer/inženjerka računarstva (magistar/magistra inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2017-10-23 11:10:12