Charles Brookman |
|
|
Superficially Charles looks, acts, sounds and juggles a lot like Boppo, although I'm not sure that's a Good Thing(tm).
As of course you know, a good way to exhaustively search for length 3 SSNs is to start with:
0 | . | . | . | . | . | . | . | . | . | . | . | . |
1 | 300 | . | . | . | . | . | . | . | . | . | . | . |
2 | 411 | 600 | 330 | . | . | . | . | . | . | . | . | . |
3 | 522 | 711 | 441 | 900 | 630 | 603 | . | . | . | . | . | . |
4 | 633 | 822 | 552 | . | 741 | 714 | 930 | 903 | 660 | . | . | . |
5 | 744 | 933 | 663 | . | 852 | 825 | . | . | 771 | 960 | 906 | . |
6 | 855 | . | 774 | . | 963 | 936 | . | . | 882 | . | . | 990 |
7 | 966 | . | 885 | . | . | . | . | . | 993 | . | . | . |
8 | . | . | 996 | . | . | . | . | . | . | . | . | . |
201 | . | . | . | . | . | . | . | . |
312 | 501 | 420 | . | . | . | . | . | . |
423 | 612 | 531 | 801 | 504 | 720 | . | . | . |
534 | 723 | 642 | 912 | 615 | 831 | 804 | 750 | . |
645 | 834 | 753 | . | 726 | 942 | 915 | 861 | 807 |
756 | 945 | 864 | . | 837 | . | . | 972 | 918 |
867 | . | 975 | . | 948 | . | . | . | . |
978 | . | . | . | . | . | . | . | . |
&c &c.
Similarly, for Multiplex patterns, eg:
"adding" together the 3 permutations of 330 and 441 to give the 5-ball patterns: SS:[43][43]1 , SS:4[43][31] , SS:[43]4[31]
{of which only the 1st is easy - I find the others harder due to the [31]}
&c &c.
However, I've less experience of Synch patterns, so what would be an interesting algorithm of enumerating all (say) length 6 patterns?
Something like? {commas omitted to avoid keystrain}:
What might be a nice (numeric) way to go from pattern to pattern without having to draw ladders?
-- cab
See Inventing Synchronous Patterns. Still thinking about the modification methods for sync patterns. -- cdw
Still working on the bigger pages...
Contents |
Links on this page
|
|
Quotation from Tim Berners-Lee |