Geometric particle swarm optimization for the sudoku puzzle

Alberto Moraglio, Julian Togelius

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

    Abstract

    Geometric particle swarm optimization (GPSO) is a recentlyintroduced generalization of traditional particle swarm optimization(PSO) that applies to all combinatorial spaces. The aim of thispaper is to demonstrate the applicability of GPSO to non-trivialcombinatorial spaces. The Sudoku puzzle is a perfect candidate totest new algorithmic ideas because it is entertaining andinstructive as well as a non-trivial constrained combinatorialproblem. We apply GPSO to solve the sudoku puzzle.

    Original languageEnglish (US)
    Title of host publicationProceedings of GECCO 2007: Genetic and Evolutionary Computation Conference
    Pages118-125
    Number of pages8
    DOIs
    StatePublished - 2007
    Event9th Annual Genetic and Evolutionary Computation Conference, GECCO 2007 - London, United Kingdom
    Duration: Jul 7 2007Jul 11 2007

    Other

    Other9th Annual Genetic and Evolutionary Computation Conference, GECCO 2007
    CountryUnited Kingdom
    CityLondon
    Period7/7/077/11/07

    Fingerprint

    Geometric Optimization
    Particle swarm optimization (PSO)
    Particle Swarm Optimization
    Demonstrate

    Keywords

    • Geometric crossover
    • Metric space
    • Particle swarm
    • Sudoku

    ASJC Scopus subject areas

    • Artificial Intelligence
    • Software
    • Theoretical Computer Science

    Cite this

    Moraglio, A., & Togelius, J. (2007). Geometric particle swarm optimization for the sudoku puzzle. In Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference (pp. 118-125) https://doi.org/10.1145/1276958.1276975

    Geometric particle swarm optimization for the sudoku puzzle. / Moraglio, Alberto; Togelius, Julian.

    Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference. 2007. p. 118-125.

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

    Moraglio, A & Togelius, J 2007, Geometric particle swarm optimization for the sudoku puzzle. in Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference. pp. 118-125, 9th Annual Genetic and Evolutionary Computation Conference, GECCO 2007, London, United Kingdom, 7/7/07. https://doi.org/10.1145/1276958.1276975
    Moraglio A, Togelius J. Geometric particle swarm optimization for the sudoku puzzle. In Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference. 2007. p. 118-125 https://doi.org/10.1145/1276958.1276975
    Moraglio, Alberto ; Togelius, Julian. / Geometric particle swarm optimization for the sudoku puzzle. Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference. 2007. pp. 118-125
    @inproceedings{3634d6e4f5dc4cb6bb78c5d8257ecb3f,
    title = "Geometric particle swarm optimization for the sudoku puzzle",
    abstract = "Geometric particle swarm optimization (GPSO) is a recentlyintroduced generalization of traditional particle swarm optimization(PSO) that applies to all combinatorial spaces. The aim of thispaper is to demonstrate the applicability of GPSO to non-trivialcombinatorial spaces. The Sudoku puzzle is a perfect candidate totest new algorithmic ideas because it is entertaining andinstructive as well as a non-trivial constrained combinatorialproblem. We apply GPSO to solve the sudoku puzzle.",
    keywords = "Geometric crossover, Metric space, Particle swarm, Sudoku",
    author = "Alberto Moraglio and Julian Togelius",
    year = "2007",
    doi = "10.1145/1276958.1276975",
    language = "English (US)",
    isbn = "1595936971",
    pages = "118--125",
    booktitle = "Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference",

    }

    TY - GEN

    T1 - Geometric particle swarm optimization for the sudoku puzzle

    AU - Moraglio, Alberto

    AU - Togelius, Julian

    PY - 2007

    Y1 - 2007

    N2 - Geometric particle swarm optimization (GPSO) is a recentlyintroduced generalization of traditional particle swarm optimization(PSO) that applies to all combinatorial spaces. The aim of thispaper is to demonstrate the applicability of GPSO to non-trivialcombinatorial spaces. The Sudoku puzzle is a perfect candidate totest new algorithmic ideas because it is entertaining andinstructive as well as a non-trivial constrained combinatorialproblem. We apply GPSO to solve the sudoku puzzle.

    AB - Geometric particle swarm optimization (GPSO) is a recentlyintroduced generalization of traditional particle swarm optimization(PSO) that applies to all combinatorial spaces. The aim of thispaper is to demonstrate the applicability of GPSO to non-trivialcombinatorial spaces. The Sudoku puzzle is a perfect candidate totest new algorithmic ideas because it is entertaining andinstructive as well as a non-trivial constrained combinatorialproblem. We apply GPSO to solve the sudoku puzzle.

    KW - Geometric crossover

    KW - Metric space

    KW - Particle swarm

    KW - Sudoku

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

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

    U2 - 10.1145/1276958.1276975

    DO - 10.1145/1276958.1276975

    M3 - Conference contribution

    AN - SCOPUS:34548103605

    SN - 1595936971

    SN - 9781595936974

    SP - 118

    EP - 125

    BT - Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference

    ER -