prikaz prve stranice dokumenta Rješavanje bugarskog solitera
  Download
PDF 887.29 KB
undergraduate thesis
Rješavanje bugarskog solitera
2015. urn:nbn:hr:166:401297
Brečić, Bože
University of Split
Faculty of Science
Department of Informatics

Cite this document

Brečić, B. (2015). Rješavanje bugarskog solitera (Undergraduate thesis). Split: University of Split, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:166:401297

Brečić, Bože. "Rješavanje bugarskog solitera." Undergraduate thesis, University of Split, Faculty of Science, 2015. https://urn.nsk.hr/urn:nbn:hr:166:401297

Brečić, Bože. "Rješavanje bugarskog solitera." Undergraduate thesis, University of Split, Faculty of Science, 2015. https://urn.nsk.hr/urn:nbn:hr:166:401297

Brečić, B. (2015). 'Rješavanje bugarskog solitera', Undergraduate thesis, University of Split, Faculty of Science, accessed 26 October 2024, https://urn.nsk.hr/urn:nbn:hr:166:401297

Brečić B. Rješavanje bugarskog solitera [Undergraduate thesis]. Split: University of Split, Faculty of Science; 2015 [cited 2024 October 26] Available at: https://urn.nsk.hr/urn:nbn:hr:166:401297

B. Brečić, "Rješavanje bugarskog solitera", Undergraduate thesis, University of Split, Faculty of Science, Split, 2015. Available at: https://urn.nsk.hr/urn:nbn:hr:166:401297

Please login to the repository to save this object to your list.
Metadata
TitleRješavanje bugarskog solitera
Title (english)Solving Bulgarian Solitare
AuthorBože Brečić
MentorBranko Žitko (mentor)
Committee memberBranko Žitko (predsjednik povjerenstva)
Committee memberAni Grubišić (član povjerenstva)
Committee memberDivna Krpan (član povjerenstva)
GranterUniversity of Split
Faculty of Science
(Department of Informatics)
Split
Defense date and country2015-09-25, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Poopćenje Bugarskog solitera je problem pronalaska svih poredaka brojeva koji se dogode dok poredak ne bude konačan za trokutaste brojeve ili dok se poredak ne ponovi. Mnogi matematički problemi se mogu reducirati na problem Bugarskog solitera. Istraženo je rješenje koje heurstičkim pristupom rješava problem. Prikazan je postupak optimalnog rješavanja poopćenog problema Bugarskog solitera algoritmom. Algoritam je implementiran u Pythonu. Rezultati izvršavanja algoritma su analizirani i uspoređeni, te je pokazana vremenska i prostorna složenost za algoritam koji rješava Bugarski soliter.
Abstract (english)
Generalization of Bulgarian solitaire is problem of finding every position of number that occur while position is not in the stable position for triangular number or until position is not repeated. Many mathematical problems can be reduced by Bulgarian solitaire. Solution that use heuristics to solve problem are researched. Procedure of optimal solving generalized Bulgarian solitaire using algorithm is shown. Algorithm are implemented in Python. Results of execution algorithm are analyzed and compared, time and space complexity for algorithm are shown.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:166:401297
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 Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) icon
Created on2017-05-09 15:18:58