DocumentCode :
3274372
Title :
Solving Japanese puzzles by genetic algorithms
Author :
Tsai, Jinn-Tsong ; Chou, Ping-Yi
Author_Institution :
Dept. of Comput. Sci., Nat. Pingtung Univ. of Educ., Pingtung, Taiwan
Volume :
2
fYear :
2011
fDate :
10-13 July 2011
Firstpage :
785
Lastpage :
788
Abstract :
A genetic algorithm (GA) with the condensed encoding and the improved fitness function is used to solve Japanese puzzles. In this study, the condensed encoding can make sure that the chromosome is a feasible solution in rows for Japanese puzzles. In the reconstruction process of a Japanese nonogram, the numbers in the left column are used as encoding conditions, and the numbers in the top row with the improved fitness function are employed to evaluate the reconstruction result. From the computational experiments, the GA is effectively applied to solve a Japanese puzzle.
Keywords :
games of skill; genetic algorithms; Japanese nonogram; Japanese puzzles; chromosome; condensed encoding; fitness function; genetic algorithms; reconstruction process; Biological cells; Cybernetics; Encoding; Genetic algorithms; Job shop scheduling; Machine learning; Condensed encoding; Genetic algorithms; Japanese puzzles;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics (ICMLC), 2011 International Conference on
Conference_Location :
Guilin
ISSN :
2160-133X
Print_ISBN :
978-1-4577-0305-8
Type :
conf
DOI :
10.1109/ICMLC.2011.6016787
Filename :
6016787
Link To Document :
بازگشت