释义 |
munching squares munching squaresA display hack dating back to the PDP-1 (ca. 1962,reportedly discovered by Jackson Wright), which employs atrivial computation (repeatedly plotting the graph Y = X XOR Tfor successive values of T - see HAKMEM items 146--148) toproduce an impressive display of moving and growing squaresthat devour the screen. The initial value of T is treated asa parameter, which, when well-chosen, can produce amazingeffects. Some of these, later (re)discovered on the LISP Machine, have been christened "munching triangles" (try ANDfor XOR and toggling points instead of plotting them),"munching w's", and "munching mazes". More generally, supposea graphics program produces an impressive and ever-changingdisplay of some basic form, foo, on a display terminal, anddoes it using a relatively simple program; then the program(or the resulting display) is likely to be referred to as"munching foos". [This is a good example of the use of theword foo as a metasyntactic variable.] |