|
|
|
|
| LEADER |
02712na a2200229 4500 |
| 003 |
HR-ZaFER |
| 008 |
160221s2016 ci ||||| m||| 00| 0 hr d |
| 035 |
|
|
|a (HR-ZaFER)ferid3791
|
| 040 |
|
|
|a HR-ZaFER
|b hrv
|c HR-ZaFER
|e ppiak
|
| 100 |
1 |
|
|a Džapo, Frane
|
| 245 |
1 |
0 |
|a Program za generiranje križaljke :
|b završni rad /
|c Frane Džapo ; [mentor Nikica Hlupić].
|
| 246 |
1 |
|
|a Application for generating crosswords
|i Naslov na engleskom:
|
| 260 |
|
|
|a Zagreb,
|b F. Džapo,
|c 2016.
|
| 300 |
|
|
|a 22 str. ;
|c 30 cm +
|e CD-ROM
|
| 502 |
|
|
|b preddiplomski studij
|c Fakultet elektrotehnike i računarstva u Zagrebu
|g smjer: Programsko inženjerstvo i informacijski sustavi, šifra smjera: 39, datum predaje: 2016-06-17, datum završetka: 2016-09-12
|
| 520 |
3 |
|
|a Sažetak na hrvatskom: Cilj ovog rada je izrada web aplikacije koja korisnicima generira križaljku za rješavanje, te im omogućava interaktivno rješavanje generirane križaljke. U svrhu izrade aplikacije u sklopu ovog rada su proučavani Constraint satisfaction problemi, te algoritmi za rješavanje tih problema. Problematika generiranja križaljke se modelira u Constraint satisfaction problem, te se standardni algoritmi za rješavanje tih problema iskoriste u svrhu generiranja križaljke. Svaki od algoritama korištenih za generiranje križaljke se detaljno opisuje, te se dodatno ističu preinake potrebne za uporabu u svrsi generiranja križaljke. Na samom kraju ovog rada različiti algoritmi se uspoređuju, te se pokazuje koja kombinacija algoritama daje najbolje rezultate.
|
| 520 |
3 |
|
|a Sažetak na engleskom: The goal of this bachelor's thesis is to design and create a web application that will provide its users a crossword puzzle and allow them to interactively solve that puzzle. In the scope of this thesis a Constraint satisfaction problems and algorithms for solving them are studied with the purpose of creating a web aplication. The problem of crossword generation is modeled into a Constraint satisfaction problem so standard algorithms for solving them could be used for generating crosswords. Each of the algorithms used in crossword generation is described in detail with special emphasis on the changes that needed to be made in order for the algorithm be used for crossword generation. At the very end of this thesis different algorithms are compared against each other and it is concluded which algorithm combination produces best results.
|
| 653 |
|
1 |
|a Križaljka
|a ograničenja
|a redukcija domene
|a promašaj
|a problemi zadovoljavanja ograničenja
|a pretraživanje
|
| 653 |
|
1 |
|a Crossword
|a constraints
|a domain reduction
|a dead-end
|a constraint satisfaction problems
|a search
|
| 700 |
1 |
|
|a Hlupić, Nikica
|4 ths
|
| 942 |
|
|
|c Z
|
| 999 |
|
|
|c 48503
|d 48503
|