Paper by Erik D. Demaine

Reference:

Erik D. Demaine and Martin L. Demaine, “Puzzles, Art, and Magic with Algorithms”, Theory of Computing Systems, volume 39, number 3, June 2006, pages 473–481. Special issue of selected papers from the 3rd International Conference on Fun with Algorithms, 2004.

BibTeX

@Article{FUN2004i_TheoryComputSys,
  AUTHOR        = {Erik D. Demaine and Martin L. Demaine},
  TITLE         = {Puzzles, Art, and Magic with Algorithms},
  JOURNAL       = {Theory of Computing Systems},
  journalurl    = {https://link.springer.com/journal/224},
  VOLUME        = 39,
  NUMBER        = 3,
  MONTH         = {June},
  YEAR          = 2006,
  PAGES         = {473--481},
  NOTE          = {Special issue of selected papers from the 3rd International
                   Conference on Fun with Algorithms, 2004.},

  length        = {10 pages},
  papers        = {FUN2004i},
  replaces      = {FUN2004i},
  copyright     = {Copyright held by the authors.},
  doi           = {https://dx.doi.org/10.1007/s00224-005-1241-3},
  dblp          = {https://dblp.org/rec/journals/mst/DemaineD06},
  comments      = {This paper is also available from <A HREF="https://doi.org/10.1007/s00224-005-1241-3">SpringerLink</A>.},
  category      = {art},
}

Abstract:

Solving and designing puzzles, creating sculpture and architecture, and inventing magic tricks all lead to fun and interesting algorithmic problems. This paper describes some of our explorations into these areas.

Comments:

This paper is also available from SpringerLink.

Copyright:

Copyright held by the authors.

Length:

The paper is 10 pages.

Availability:

The paper is available in PostScript (5247k), gzipped PostScript (2970k), and PDF (5156k).

See information on file formats.

[Google Scholar search]

Related papers:

FUN2004i (Puzzles, Art, and Magic with Algorithms)