| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Klos, T. | |
| dc.contributor.author | Salam, J.J. | |
| dc.date.accessioned | 2018-10-06T17:00:53Z | |
| dc.date.available | 2018-10-06T17:00:53Z | |
| dc.date.issued | 2018 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/36388 | |
| dc.description.abstract | A comparison of complete and incomplete search methods via application of backtracking and local search on a constrain satisfaction problem. Namely, Calcudoku puzzles. | |
| dc.description.sponsorship | Utrecht University | |
| dc.format.extent | 620211 | |
| dc.format.mimetype | application/zip | |
| dc.language.iso | en_US | |
| dc.title | The superior search method | |
| dc.type.content | Bachelor Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | Backtracking, local search, complete search, incomplete search | |
| dc.subject.courseuu | Cognitive Artificial Intelligence | |
