prikaz prve stranice dokumenta Rješavanje problema krastača i žaba
Access restricted to students and staff of home institution
undergraduate thesis
Rješavanje problema krastača i žaba
2022. urn:nbn:hr:166:357135
Vrkić, Ante
University of Split
Faculty of Science
Department of Informatics

Cite this document

Vrkić, A. (2022). Rješavanje problema krastača i žaba (Undergraduate thesis). Split: University of Split, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:166:357135

Vrkić, Ante. "Rješavanje problema krastača i žaba." Undergraduate thesis, University of Split, Faculty of Science, 2022. https://urn.nsk.hr/urn:nbn:hr:166:357135

Vrkić, Ante. "Rješavanje problema krastača i žaba." Undergraduate thesis, University of Split, Faculty of Science, 2022. https://urn.nsk.hr/urn:nbn:hr:166:357135

Vrkić, A. (2022). 'Rješavanje problema krastača i žaba', Undergraduate thesis, University of Split, Faculty of Science, accessed 25 October 2024, https://urn.nsk.hr/urn:nbn:hr:166:357135

Vrkić A. Rješavanje problema krastača i žaba [Undergraduate thesis]. Split: University of Split, Faculty of Science; 2022 [cited 2024 October 25] Available at: https://urn.nsk.hr/urn:nbn:hr:166:357135

A. Vrkić, "Rješavanje problema krastača i žaba", Undergraduate thesis, University of Split, Faculty of Science, Split, 2022. Available at: https://urn.nsk.hr/urn:nbn:hr:166:357135

Please login to the repository to save this object to your list.
Metadata
TitleRješavanje problema krastača i žaba
Title (english)Solving toads and frogs problem
AuthorAnte Vrkić
MentorBranko Žitko (mentor)
Committee memberBranko Žitko (predsjednik povjerenstva)
Committee memberHrvoje Kalinić (član povjerenstva)
Committee memberGoran Zaharija (član povjerenstva)
GranterUniversity of Split
Faculty of Science
(Department of Informatics)
Split
Defense date and country2022-09-27, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Problem žaba i krastača je kombinatorna igra u kojoj je cilj zamijeniti početne pozicije žaba i krastača u minimalnom broju poteza koristeći samo poteze skoka i koraka. Nalaze se na suprotnim stranama jednodimenzionalne ploče dužine n + m + 1, gdje je n broj žaba i m broj krastača. Na početku rada se spominju slični problemi izvedeni iz ovoga, te njegovo stanje istraženosti i nagađanja raznih matematičara kako ga optimalno riješiti. U radu su objašnjeni logički i matematički pristupi rješavanja ovog problema, te matematički dokaz da se ustinu postiže rješenje u minimalnom broju poteza. Implementiran je u programskom jeziku Python, te objašnjen u pseudo kodu i analiziran grafičkim prikazom.
Abstract (english)
The Frogs and Toads problem is a combinatorial game where the goal is to swap the starting positions of the frogs and toads in the minimum number of moves using only jump and step moves. They are located on the opposite sides of a one-dimensional board with the length n + m + 1, where n is the number of frogs and m is the number of toads. At the beginning of the paper, similar problems derived from this one are mentioned, as well as its state of research and the speculations of various mathematicians on how to optimally solve it. The paper explains the logical and mathematical approaches to solving this problem, as well as the mathematical proof that the solution can actually be achieved in the calculated minimum number of moves. It is implemented in the Python programming language, explained in pseudocode and analyzed graphically.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:166:357135
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 on2023-03-02 13:14:03