1 / 19

MUNCHING SQUARES

MUNCHING SQUARES. A plot of the cells on a grid satisfying bitwise XOR (x, y) < n for consecutive values of n. n = 1, 2, .... grid size It is thought that it was discovered by Jackson Wright on the RLE PDP-1 around 1962.

jerzy
Download Presentation

MUNCHING SQUARES

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. MUNCHING SQUARES

  2. A plot of the cells on a grid satisfying bitwise XOR (x, y) < n for consecutive values of n. n = 1, 2, .... grid size It is thought that it was discovered by Jackson Wright on the RLE PDP-1 around 1962

  3. The colour of each pixel is determined by comparing the bit XOR (exclusive or) of its row and column indices with the selected threshold (n)

  4. The colour of each pixel is determined by comparing the bit XOR (exclusive or) of its row and column indices with the selected threshold (n) Convert cell indices to binary Set n = 1 000 XOR 000 000 Is 0 < 1?

  5. The colour of each pixel is determined by comparing the bit XOR (exclusive or) of its row and column indices with the selected threshold (n) Convert cell indices to binary Set n = 1 000 XOR 001 001 Is 1 < 1?

  6. The colour of each pixel is determined by comparing the bit XOR (exclusive or) of its row and column indices with the selected threshold (n) Convert cell indices to binary Set n = 1 000 XOR 010 010 Is 2 < 1?

  7. The colour of each pixel is determined by comparing the bit XOR (exclusive or) of its row and column indices with the selected threshold (n) Convert cell indices to binary Set n = 1

  8. The colour of each pixel is determined by comparing the bit XOR (exclusive or) of its row and column indices with the selected threshold (n) Convert cell indices to binary Set n = 1 001 XOR 000 001 Is 1 < 1?

  9. The colour of each pixel is determined by comparing the bit XOR (exclusive or) of its row and column indices with the selected threshold (n) Convert cell indices to binary Set n = 1 001 XOR 001 000 Is 0 < 1?

  10. The colour of each pixel is determined by comparing the bit XOR (exclusive or) of its row and column indices with the selected threshold (n) Convert cell indices to binary Set n = 1

  11. The colour of each pixel is determined by comparing the bit XOR (exclusive or) of its row and column indices with the selected threshold (n) Convert cell indices to binary Set n = 2

  12. The colour of each pixel is determined by comparing the bit XOR (exclusive or) of its row and column indices with the selected threshold (n) Convert cell indices to binary Set n = 3

  13. Good expressions: j ^ i < t (original munch squares) i == j^t ((i | t) mod (j | t)) j mod (t+1) == i t&i^j < t|i i^j^t < i|j|t t div ~i == t div ~j i^j|t < j&t i^t^j mod 5 j ^ i < i & t j & i < t ^ (t mod 3) (t div ~i^j) < (t div ~j^i) (i&t) mod ((j&t)+1) (i&t) mod ((j&t)+1) == i i^t+2&j

  14. but computational thought My Favourite Book not just coding

More Related