prikaz prve stranice dokumenta Minimax algoritam u automatskom igranju šaha
Access restricted to students and staff of home institution
undergraduate thesis
Minimax algoritam u automatskom igranju šaha
2020. urn:nbn:hr:166:420148
Ujević, Luka
University of Split
Faculty of Science
Department of Informatics

Cite this document

Ujević, L. (2020). Minimax algoritam u automatskom igranju šaha (Undergraduate thesis). Split: University of Split, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:166:420148

Ujević, Luka. "Minimax algoritam u automatskom igranju šaha." Undergraduate thesis, University of Split, Faculty of Science, 2020. https://urn.nsk.hr/urn:nbn:hr:166:420148

Ujević, Luka. "Minimax algoritam u automatskom igranju šaha." Undergraduate thesis, University of Split, Faculty of Science, 2020. https://urn.nsk.hr/urn:nbn:hr:166:420148

Ujević, L. (2020). 'Minimax algoritam u automatskom igranju šaha', Undergraduate thesis, University of Split, Faculty of Science, accessed 28 November 2024, https://urn.nsk.hr/urn:nbn:hr:166:420148

Ujević L. Minimax algoritam u automatskom igranju šaha [Undergraduate thesis]. Split: University of Split, Faculty of Science; 2020 [cited 2024 November 28] Available at: https://urn.nsk.hr/urn:nbn:hr:166:420148

L. Ujević, "Minimax algoritam u automatskom igranju šaha", Undergraduate thesis, University of Split, Faculty of Science, Split, 2020. Available at: https://urn.nsk.hr/urn:nbn:hr:166:420148

Please login to the repository to save this object to your list.
Metadata
TitleMinimax algoritam u automatskom igranju šaha
Title (english)Minimax algorithm in chess engine
AuthorLuka Ujević
MentorSaša Mladenović (mentor)
Committee memberSaša Mladenović (predsjednik povjerenstva)
Committee memberGoran Zaharija (član povjerenstva)
Committee memberDivna Krpan (član povjerenstva)
GranterUniversity of Split
Faculty of Science
(Department of Informatics)
Split
Defense date and country2020-09-18, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Rad se sastoji od pisanog i praktičnog dijela. Tema rada je MiniMax algoritam pretrage u šahu, te način kako računalo igra šah. U uvodu se govori o povijesti računalnog šaha, i objašnjeni su principi na temelju kojih računalo odigrava poteze. U glavnom djelu rada govori se o dva algoritma: MiniMax i apha-beta odrezivanju, i objašnjen je njihov princip rada. Zatim slijedi praktični dio, gdje sam opisao kako sam napravio web stranicu u kojoj korisnik može započeti igru, te cilj mu je pronaći šah-mat u maksimalno dva poteza. U zaključku sam se osvrnuo na utjecaj računala na moderni šah.
Abstract (english)
Subject of the thesis is MiniMax algorithm in chess engine. First part speaks about history of computer chess and how computer decides about which move is best to play. The main part is about two search algorithms: MiniMax and alpha-beta pruning. In this section I explained how these two algorithms work, and how computer search for best move to play. Final part is all about my practical work, which contains simple web page, where user can play against computer some chess position. The task of user is mate computer in two moves maximum. User can let computer to mate him or her in two moves also. In conclusion I speak about role of chess engine in modern chess.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:166:420148
Study programmeTitle: Computer Science and Technics
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) informatike i tehnike (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) informatike i tehnike)
Type of resourceText
File originBorn digital
Access conditionsAccess restricted to students and staff of home institution
Terms of useLicence In copyright icon
Created on2021-01-14 10:58:39