computer poem

ChessBard inputs the algebraic notation for a chess game in .PGN format (digital file format for archived chess games) and the Chessbard outputs a poem. The poems are based on 12 source poems Aaron wrote, 6 poems for the white pieces, 6 poems for the black pieces: there is a 64 word poem for each colour’s pawns, knights, rooks, bishop, queen and king. When a piece lands on a square it triggers a word from the source poems and the translator compiles them together and outputs a poem.

Round is a computational poem that is both non-interactive and deterministic. It is computational in that computation is an essential aspect of the work, non-interactive because there is no input accepted as the program runs, and deterministic because the text produced should be the same each time on any properly-functioning computer. The poem is also infinite (in the sense of boundless); there is no final line or internally specified condition that will cause the program will stop. Round is not never-ending, since whatever computational resources one has will eventually be exhausted, but there is no pre-set length to the poem. The poem is assembled out of ten fragments, one of which is a newline (line break). The other nine are strings of legible text. Round computes the digits of π, pausing after each digit is computed. (Each time Round is loaded, it begins at 3, continues to 1, continues to 4, and so on.) For each digit computed, the fragment corresponding to that digit is added to the poem. If the fragment selected is a line break, Round begins a new line. (Source: author description)

A computer poem generating stanzas through different word combinations as in a slot poem/database.