A fast algorithm for logical puzzle Skyscrapers solving in C++ programming language

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.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