HIROIMONO is NP-complete

Forfattere

  • Daniel Andersson

DOI:

https://doi.org/10.7146/brics.v14i1.21924

Resumé

In a Hiroimono puzzle, one must collect a set of stones from a square grid, moving along grid lines, picking up stones as one encounters them, and changing direction only when one picks up a stone. We show that deciding the solvability of such puzzles is NP-complete.

Downloads

Publiceret

2007-01-12

Citation/Eksport

Andersson, D. (2007). HIROIMONO is NP-complete. BRICS Report Series, 14(1). https://doi.org/10.7146/brics.v14i1.21924

Nummer

Nr. 1 (2007): RS-1 HIROIMONO is NP-complete

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).