prikaz prve stranice dokumenta Rješavanje problema skakača
  Download
PDF 671.24 KB
undergraduate thesis
Rješavanje problema skakača
2022. urn:nbn:hr:166:033853
Herceg, Ivana
University of Split
Faculty of Science
Department of Informatics

Cite this document

Herceg, I. (2022). Rješavanje problema skakača (Undergraduate thesis). Split: University of Split, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:166:033853

Herceg, Ivana. "Rješavanje problema skakača." Undergraduate thesis, University of Split, Faculty of Science, 2022. https://urn.nsk.hr/urn:nbn:hr:166:033853

Herceg, Ivana. "Rješavanje problema skakača." Undergraduate thesis, University of Split, Faculty of Science, 2022. https://urn.nsk.hr/urn:nbn:hr:166:033853

Herceg, I. (2022). 'Rješavanje problema skakača', Undergraduate thesis, University of Split, Faculty of Science, accessed 20 April 2024, https://urn.nsk.hr/urn:nbn:hr:166:033853

Herceg I. Rješavanje problema skakača [Undergraduate thesis]. Split: University of Split, Faculty of Science; 2022 [cited 2024 April 20] Available at: https://urn.nsk.hr/urn:nbn:hr:166:033853

I. Herceg, "Rješavanje problema skakača", Undergraduate thesis, University of Split, Faculty of Science, Split, 2022. Available at: https://urn.nsk.hr/urn:nbn:hr:166:033853

Please login to the repository to save this object to your list.
Metadata
TitleRješavanje problema skakača
Title (english)Six Knights
AuthorIvana Herceg
MentorBranko Žitko (mentor)
Committee memberBranko Žitko (predsjednik povjerenstva)
Committee memberAni Grubišić (član povjerenstva)
Committee memberLucija Bročić (član povjerenstva)
GranterUniversity of Split
Faculty of Science
(Department of Informatics)
Split
Defense date and country2022-09-21, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Poopćenje problema skakača je problem pronalaska minimalnog broja poteza za bilo koju početnu i ciljnu šahovsku ploču. Kretanje skakača na šahovskoj ploči može se prikazati pomoću grafa. Pozicije na šahovskoj ploči smo prikazali kao vrhove, a povezanost između vrhova smo prikazali bridovima. Za rješavanje problema koristili smo najjednostavniji algoritam pretrage, algoritam iscrpnog pretraživanja. Algoritam je implementiran u programskom jeziku Python.
Abstract (english)
A generalization of six knights’ problem is finding the minimal amount of moves for any starting and final chess position. A knight’s movement can be modeled with a graph. Each vertex in the modelling graph represents a chess position, white the edges represent possible knight’s moves that mutate the game state. In this paper, the problem was approached using a naive search algorithm which was implemented in Python.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:166:033853
Study programmeTitle: Computer Science
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) informatike (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) informatike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2022-11-24 10:44:16