Publikace UTB
Repozitář publikační činnosti UTB

Cracking kakuro puzzles by differential evolution

Repozitář DSpace/Manakin

Zobrazit minimální záznam


dc.title Cracking kakuro puzzles by differential evolution en
dc.contributor.author Boudná, Hana
dc.relation.ispartof Annals of DAAAM and Proceedings of the International DAAAM Symposium
dc.identifier.issn 1726-9679 Scopus Sources, Sherpa/RoMEO, JCR
dc.identifier.isbn 978-3-901509-73-5
dc.date.issued 2010
dc.citation.spage 1291
dc.citation.epage 1292
dc.event.title Annals of DAAAM for 2010 and 21st International DAAAM Symposium Intelligent Manufacturing and Automation: Focus on Interdisciplinary Solutions""
dc.event.location Zadar
utb.event.state-en Croatia
utb.event.state-cs Chorvatsko
dc.event.sdate 2010-10-20
dc.event.edate 2010-10-23
dc.type conferenceObject
dc.language.iso en
dc.publisher Danube Adria Association for Automation and Manufacturing, DAAAM
dc.relation.uri http://www.daaam.info/Downloads/Pdfs/proceedings/proceedings_2010/24546_Young_1_head.pdf
dc.subject Differential Evolution en
dc.subject Kakuro en
dc.subject Puzzle en
dc.description.abstract Kakuro is a logic puzzle, often refered to as mathematical equivalent of a crossword. There is also another one - Sudoku - which has successfully been solved by means of evolutionary algorithms. However, not many fruitful evolutionary approaches to unriddleKakuroseem to be accomplished yet. This paper uncovers this challenging problem and presents an attempt to crackKakuro by employing Differential Evolution as a solver. en
utb.faculty Faculty of Technology
dc.identifier.uri http://hdl.handle.net/10563/1005178
utb.identifier.rivid RIV/70883521:28140/10:63509051!RIV11-MSM-28140___
utb.identifier.obdid 43864051
utb.identifier.scopus 2-s2.0-84904410966
utb.source d-scopus
dc.date.accessioned 2015-06-29T11:54:18Z
dc.date.available 2015-06-29T11:54:18Z
dc.rights.uri https://open.k.utb.cz/blog/2021/04/19/daaam/
dc.rights.access openAccess
utb.contributor.internalauthor Boudná, Hana
Find Full text

Soubory tohoto záznamu

Zobrazit minimální záznam