prikaz prve stranice dokumenta Brzi algoritam za rješavanje logičke zagonetke Neboderi u programskom jeziku C++
  Download
PDF 429.33 KB
undergraduate thesis
Brzi algoritam za rješavanje logičke zagonetke Neboderi u programskom jeziku C++
Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2020. urn:nbn:hr:200:586062
Paradžik, Ivan
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

Paradžik, I. (2020). Brzi algoritam za rješavanje logičke zagonetke Neboderi 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:586062

Paradžik, Ivan. "Brzi algoritam za rješavanje logičke zagonetke Neboderi u programskom jeziku C++." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2020. https://urn.nsk.hr/urn:nbn:hr:200:586062

Paradžik, Ivan. "Brzi algoritam za rješavanje logičke zagonetke Neboderi u programskom jeziku C++." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2020. https://urn.nsk.hr/urn:nbn:hr:200:586062

Paradžik, I. (2020). 'Brzi algoritam za rješavanje logičke zagonetke Neboderi u programskom jeziku C++', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 29 April 2024, https://urn.nsk.hr/urn:nbn:hr:200:586062

Paradžik I. Brzi algoritam za rješavanje logičke zagonetke Neboderi u programskom jeziku C++ [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2020 [cited 2024 April 29] Available at: https://urn.nsk.hr/urn:nbn:hr:200:586062

I. Paradžik, "Brzi algoritam za rješavanje logičke zagonetke Neboderi u programskom jeziku C++", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2020. Available at: https://urn.nsk.hr/urn:nbn:hr:200:586062

Metadata
TitleBrzi algoritam za rješavanje logičke zagonetke Neboderi u programskom jeziku C++
Title (english)A fast algorithm for logical puzzle Skyscrapers solving in C++ programming language
AuthorIvan Paradžik
MentorTomislav Rudec (mentor)
MentorAlfonzo Baumgartner (sumentor)
Committee memberTomislav Rudec (predsjednik povjerenstva)
Committee memberZdravko Krpić (član povjerenstva)
Committee memberČaslav Livada (član povjerenstva)
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 country2020-09-25, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Program Engineering
Abstract
Cilj ovog rada bio je napraviti algoritam u C programskom jeziku. Alogoritam je trebao riješiti jednu korisnički unesenu logičku zagonetku Neboderi. Takva zagonetka izgledom podsjeća na sudoku, a oblika je kvadratne matrice. Cilj ove zagonetke je popuniti matricu NxN brojevima od 1 do N na način da se u istom stupcu i istom retku ne ponavljaju isti brojevi. Tehnika eliminacije najkorištenija je metoda pri rješavanju zagonetke, a temelji se na eliminiranju potencijalnih mjesta za smještaj nebodera. Algoritam za rješavanje navedene zagonetke izrađen je u programskom jeziku C korištenjem unatražnog algoritma. Osmišljen je na način da riješava nebodere dimenzija 4x4, 5x5 i 6x6 po svim razinama težine: easy, medium i hard. Na ulazu u program korisnik odabire dimenziju nebodera čije će podatke nakon odabira dimenzije unijeti u program, a na izlazu programa prikazan je korisnički unesen neboder i njegovo konačno i točno rješenje.
Abstract (english)
The goal of this project was to make a program in C programming langauge. The program had to solve one user entered logic puzzle Skyscrapers. This kind of puzzle reminds of sudoku and its shape is of a square matrix. The purpose of this puzzle is to fill in a NxN matrix with numbers from 1 to N in a way that numbers in each column and row don't repeat themselves. The elimination technique is the most used technique when solving the puzzle and is based on eliminating the potential places where skyscraper should be placed in. The algorithm for solving this puzzle is programmed in C programming language and works as a backtracking algorithm. It is designed to solve skyscrapers puzzles of 4x4, 5x5 and 6x6 at all difficulty levels: easy, medium and hard. At program input user chooses the dimension of a skyscrapers puzzle and inputs its data afterwards. The program outputs the look of the puzzle and its final and correct solution.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:586062
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 on2020-11-13 16:01:49