• DocumentCode
    680769
  • Title

    Solving E-Squaro through SAT-Coding

  • Author

    Gregoire, Eric ; Hasni, Atef ; Mazure, Bertrand ; Piette, Cedric

  • Author_Institution
    Univ. Artois, Lens, France
  • fYear
    2013
  • fDate
    4-6 Nov. 2013
  • Firstpage
    955
  • Lastpage
    962
  • Abstract
    In this paper, we show that the E-SquarO puzzle, which is an extension of the popular SquarO game, is NP-complete. We propose a SAT encoding of E-SquarO and investigate its practical computational properties.
  • Keywords
    computability; computational complexity; E-SquarO puzzle; NP-complete problems; SAT encoding; Artificial intelligence; Conferences; Distance measurement; Encoding; Games; Lenses; Polynomials; NP-complete problems; SAT solving; SquarO;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Tools with Artificial Intelligence (ICTAI), 2013 IEEE 25th International Conference on
  • Conference_Location
    Herndon, VA
  • ISSN
    1082-3409
  • Print_ISBN
    978-1-4799-2971-9
  • Type

    conf

  • DOI
    10.1109/ICTAI.2013.145
  • Filename
    6735356
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=680769