prikaz prve stranice dokumenta ALGORITAM ZA GENERIRANJE ŠAHOVSKOG POTEZA U PROGRAMSKOM JEZIKU C#
  Download
PDF 919.67 KB
undergraduate thesis
ALGORITAM ZA GENERIRANJE ŠAHOVSKOG POTEZA U PROGRAMSKOM JEZIKU C#
Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2021. urn:nbn:hr:200:177855
Kvesić, David
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Core Courses
Chair of Mathematics, Physics and Mechanical Engineering

Institutional repository: Faculty of Electrical Engineering, Computer Science and Information Technology Osijek

Cite this document

Kvesić, D. (2021). ALGORITAM ZA GENERIRANJE ŠAHOVSKOG POTEZA U PROGRAMSKOM JEZIKU C# (Undergraduate 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:177855

Kvesić, David. "ALGORITAM ZA GENERIRANJE ŠAHOVSKOG POTEZA U PROGRAMSKOM JEZIKU C#." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2021. https://urn.nsk.hr/urn:nbn:hr:200:177855

Kvesić, David. "ALGORITAM ZA GENERIRANJE ŠAHOVSKOG POTEZA U PROGRAMSKOM JEZIKU C#." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2021. https://urn.nsk.hr/urn:nbn:hr:200:177855

Kvesić, D. (2021). 'ALGORITAM ZA GENERIRANJE ŠAHOVSKOG POTEZA U PROGRAMSKOM JEZIKU C#', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 10 May 2024, https://urn.nsk.hr/urn:nbn:hr:200:177855

Kvesić D. ALGORITAM ZA GENERIRANJE ŠAHOVSKOG POTEZA U PROGRAMSKOM JEZIKU C# [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2021 [cited 2024 May 10] Available at: https://urn.nsk.hr/urn:nbn:hr:200:177855

D. Kvesić, "ALGORITAM ZA GENERIRANJE ŠAHOVSKOG POTEZA U PROGRAMSKOM JEZIKU C#", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2021. Available at: https://urn.nsk.hr/urn:nbn:hr:200:177855

Metadata
TitleALGORITAM ZA GENERIRANJE ŠAHOVSKOG POTEZA U PROGRAMSKOM JEZIKU C#
Title (english)Chess Engine Algorithm in C#
AuthorDavid Kvesić
MentorTomislav Rudec (mentor)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Core Courses)
(Chair of Mathematics, Physics and Mechanical Engineering)
Osijek
Defense date and country2021-09-08, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Program Engineering
Abstract
U ovom radu opisani su teorijski principi šaha te je implementiran program koji na temelju aktualne situacije na šahovskoj ploči određuje najbolji potez. Heuristika programa temeljena je na pretpostavci da je svakoj situaciji na ploči moguće odrediti brojčanu vrijednost koja predstavlja kvalitetu poteza za igrača na redu. Tu vrijednost određuje statička funkcija evaluacije koja uzima u obzir broj, poziciju i mobilnost svih figura na ploči. Funkcija pretrage temeljena na minimax algoritmu stvara stablo svih okolnosti koje su moguće na ploči do određene dubine. Zbog eksponencijalne vremenske složenosti nužna je optimizacija pretrage. Objašnjene su implementacije α – β rezanja, sortiranja poteza i transpozicijske tablice koji značajno skraćuju vrijeme izvođenja programa. Testirane su performanse programa te su objašnjeni prisutni nedostaci u programu. Za jednostavnije korištenje programa implementirana je Windows Forms aplikacija s grafičkim korisničkim sučeljem.
Abstract (english)
This paper describes theoretical principles of chess and implements a program which generates the best move based on the current chess board situation. The heuristics of the program are based on the assumption that it is possible to determine a numerical value for each situation on the board, which represents the quality of a situation for the player on the move. That value is determined by the static evaluation function which takes into account the number, position and mobility of all the figures on the board. The search function based on the minimax algorithm creates a tree of all the circumstances that are possible on the board to a certain depth. Due to the exponential time complexity, search engine optimization is necessary. Implementations of α – β pruning, move ordering and transposition table which significantly reduce the program execution time are explained in the paper. The performance of the program is tested and its shortcomings are explained. For easier use of the program, a Windows Forms application with a graphical user interface has been implemented.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:177855
Study programmeTitle: Undergraduate University Study Programme in Computer Engineering
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2021-11-22 11:42:30