Product geometric crossover for the Sudoku puzzle

Alberto Moraglio, Julian Togelius, Simon Lucas

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Geometric crossover is a representation-independent definition of crossover based on the distance of the search space interpreted as a metric space. It generalizes the traditional crossover for binary strings and other important recombination operators for the most used representations. Using a distance tailored to the problem at hand, the abstract definition of crossover can be used to design new problem specific crossovers that embed problem knowledge in the search. In recent work, we have introduced the important notion of product geometric crossover that enables the construction of new geometric crossovers combining preexisting geometric crossovers in a simple way. In this paper, we use it to design an evolutionary algorithm to solve the Sudoku puzzle. The different types of constraints make Sudoku an interesting study case for crossover design. We conducted extensive experimental testing and found that, on medium and hard problems, the new geometric crossovers perform significantly better than hill-climbers and mutations alone.

    Original languageEnglish (US)
    Title of host publication2006 IEEE Congress on Evolutionary Computation, CEC 2006
    Pages470-476
    Number of pages7
    StatePublished - 2006
    Event2006 IEEE Congress on Evolutionary Computation, CEC 2006 - Vancouver, BC, Canada
    Duration: Jul 16 2006Jul 21 2006

    Other

    Other2006 IEEE Congress on Evolutionary Computation, CEC 2006
    CountryCanada
    CityVancouver, BC
    Period7/16/067/21/06

    Fingerprint

    Crossover
    Evolutionary algorithms
    Testing
    Crossover Design
    Recombination
    Search Space
    Metric space
    Evolutionary Algorithms
    Mutation
    Strings
    Binary
    Generalise
    Operator

    ASJC Scopus subject areas

    • Artificial Intelligence
    • Software
    • Theoretical Computer Science

    Cite this

    Moraglio, A., Togelius, J., & Lucas, S. (2006). Product geometric crossover for the Sudoku puzzle. In 2006 IEEE Congress on Evolutionary Computation, CEC 2006 (pp. 470-476). [1688347]

    Product geometric crossover for the Sudoku puzzle. / Moraglio, Alberto; Togelius, Julian; Lucas, Simon.

    2006 IEEE Congress on Evolutionary Computation, CEC 2006. 2006. p. 470-476 1688347.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Moraglio, A, Togelius, J & Lucas, S 2006, Product geometric crossover for the Sudoku puzzle. in 2006 IEEE Congress on Evolutionary Computation, CEC 2006., 1688347, pp. 470-476, 2006 IEEE Congress on Evolutionary Computation, CEC 2006, Vancouver, BC, Canada, 7/16/06.
    Moraglio A, Togelius J, Lucas S. Product geometric crossover for the Sudoku puzzle. In 2006 IEEE Congress on Evolutionary Computation, CEC 2006. 2006. p. 470-476. 1688347
    Moraglio, Alberto ; Togelius, Julian ; Lucas, Simon. / Product geometric crossover for the Sudoku puzzle. 2006 IEEE Congress on Evolutionary Computation, CEC 2006. 2006. pp. 470-476
    @inproceedings{9aab729d1cd54cbd87aae1d0295bd774,
    title = "Product geometric crossover for the Sudoku puzzle",
    abstract = "Geometric crossover is a representation-independent definition of crossover based on the distance of the search space interpreted as a metric space. It generalizes the traditional crossover for binary strings and other important recombination operators for the most used representations. Using a distance tailored to the problem at hand, the abstract definition of crossover can be used to design new problem specific crossovers that embed problem knowledge in the search. In recent work, we have introduced the important notion of product geometric crossover that enables the construction of new geometric crossovers combining preexisting geometric crossovers in a simple way. In this paper, we use it to design an evolutionary algorithm to solve the Sudoku puzzle. The different types of constraints make Sudoku an interesting study case for crossover design. We conducted extensive experimental testing and found that, on medium and hard problems, the new geometric crossovers perform significantly better than hill-climbers and mutations alone.",
    author = "Alberto Moraglio and Julian Togelius and Simon Lucas",
    year = "2006",
    language = "English (US)",
    isbn = "0780394879",
    pages = "470--476",
    booktitle = "2006 IEEE Congress on Evolutionary Computation, CEC 2006",

    }

    TY - GEN

    T1 - Product geometric crossover for the Sudoku puzzle

    AU - Moraglio, Alberto

    AU - Togelius, Julian

    AU - Lucas, Simon

    PY - 2006

    Y1 - 2006

    N2 - Geometric crossover is a representation-independent definition of crossover based on the distance of the search space interpreted as a metric space. It generalizes the traditional crossover for binary strings and other important recombination operators for the most used representations. Using a distance tailored to the problem at hand, the abstract definition of crossover can be used to design new problem specific crossovers that embed problem knowledge in the search. In recent work, we have introduced the important notion of product geometric crossover that enables the construction of new geometric crossovers combining preexisting geometric crossovers in a simple way. In this paper, we use it to design an evolutionary algorithm to solve the Sudoku puzzle. The different types of constraints make Sudoku an interesting study case for crossover design. We conducted extensive experimental testing and found that, on medium and hard problems, the new geometric crossovers perform significantly better than hill-climbers and mutations alone.

    AB - Geometric crossover is a representation-independent definition of crossover based on the distance of the search space interpreted as a metric space. It generalizes the traditional crossover for binary strings and other important recombination operators for the most used representations. Using a distance tailored to the problem at hand, the abstract definition of crossover can be used to design new problem specific crossovers that embed problem knowledge in the search. In recent work, we have introduced the important notion of product geometric crossover that enables the construction of new geometric crossovers combining preexisting geometric crossovers in a simple way. In this paper, we use it to design an evolutionary algorithm to solve the Sudoku puzzle. The different types of constraints make Sudoku an interesting study case for crossover design. We conducted extensive experimental testing and found that, on medium and hard problems, the new geometric crossovers perform significantly better than hill-climbers and mutations alone.

    UR - http://www.scopus.com/inward/record.url?scp=34547282598&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=34547282598&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:34547282598

    SN - 0780394879

    SN - 9780780394872

    SP - 470

    EP - 476

    BT - 2006 IEEE Congress on Evolutionary Computation, CEC 2006

    ER -