42 lines
3.0 KiB
Plaintext
42 lines
3.0 KiB
Plaintext
# hamiltonian cards
|
|
|
|
the hamiltonian cards are generative coloring puzzles where you follow the instructions to reveal their messages.
|
|
|
|
=> ./img/fotos_hamiltonian.gif sequence of photos showing a hamiltonian card being colored
|
|
|
|
# description
|
|
|
|
description from the ITP winter show 2016:
|
|
=> https://itp.nyu.edu/shows/winter2016/hamiltonian-cards/ Hamiltonian Cards - ITP Winter Show 2016
|
|
|
|
> They consist in a grid of cells -squares with arrows- pointing to each other in a type of sequence called Hamiltonian Path. A Hamiltonian Path in a grid is a path that visits each and every cell exactly once. Therefore, following the path of arrows and coloring each cell that you encounter you will color the whole grid. The magic occurs because there are two types of arrow: the triangular arrow indicates that you have to fill the next cell with the same color of the current cell, and the circular arrow indicates that you have to fill the next cell with the alternate color. Filling the cells and changing the fill color according to the instructions, will allow you to reveal the hidden images.
|
|
> Under the hood, the Hamiltonian Cards are created by a software that processes a monochromatic and low pixel image using a generated Hamiltonian path. The path is used to traverse the image to define the orientation of the cells in the card and their corresponding arrow shape; somewhat executing the inverse process of what you do when solving the puzzle. Multiple paths can be used to process a single image, and multiple images can be processed with the same path. Thus many unique designs can be obtained with this same software.
|
|
> This project was originated in the Visual Language class with Katherine Dillon. My idea was to create unique graphic designs that require a playful and puzzling interaction to reveal a hidden design. The best approach for me was to create generative software in p5.js and Processing that would process and encode a message in an almost never ending set of outcomes following the same basic rules.
|
|
|
|
=> https://en.wikipedia.org/wiki/Hamiltonian_path Hamiltonian path
|
|
|
|
# instructions
|
|
|
|
* choose two contrasting colors
|
|
* fill the first cell with your first color
|
|
* follow the arrows' rules to fill the next cells: Triangular: fill the NEXT cell with the SAME color. Circular: Fill the NEXT cell with the OTHER color.
|
|
* continue to follow the arrows until the page is done
|
|
|
|
=> ./img/foto_hamiltonian_cards.jpg hamiltonian cards in the process of being colored
|
|
|
|
# downloads
|
|
|
|
=> https://ipfs.io/ipfs/QmadXtQQC9Jwc7jdwt2dvXfj4oWCtfZUoGhWLYLfjqCePE ITP Winter Show 2016 Edition, 33 different Hamiltonian Cards ready to be printed (7.3MB)
|
|
|
|
=> ./img/foto_hamiltonian_cards_2.jpg a couple of people's hands interacting with the hamiltonian cards in the ITP winter show
|
|
|
|
# media
|
|
|
|
sejo briefly talking about them in the coding train
|
|
=> https://www.youtube.com/watch?v=Snv_TNrKnIU&t=608s ITP Winter Show 2016 (youtube)
|
|
|
|
# credits
|
|
|
|
* creative direction and production: {escenaconsejo}
|
|
* hamiltonian path algorithm programming: José Alberto Jurado
|