Sun Mon Tue Wed Thu Fri Sat 1 |

© Heidi Ulrich |

1 51 85 89 95 111 115 120 124 130 150 155 160 165 169 185 191 195 229 6 56 84 85 95 115 116 119 120 130 150 155 160 164 165 185 195 196 224 41 49 76 85 95 99 115 120 121 130 150 155 159 160 165 181 185 195 239 21 56 69 85 95 101 115 119 120 130 150 155 160 161 165 179 185 195 259 26 61 62 78 97 103 106 111 113 134 138 142 146 169 177 183 202 218 254

I took the idea of the new program by looking at a solution for 7 and putting the numbers into a matrix of 6 columns and 7 rows, such that the rows summed up to 60 and the columns up to 70. Each cell is either empty or contains exactly one number. Now it turns out that there are many solutions that have the same pattern with filled and empty cells (when normalized). The columns and rows can be sorted such that the number of filled cell in each row of column increases or stays the same. The program consists of three nested 'loops'. In the outer loop the program tries all possibilties of numbers of filled columns and columns. In the middle loop, given the number of cells that need to be filled in each row and column, if finds every possibility to empty and filled cells. Before continueing, the program checks if the solution is unique by permuting all columns and rows (with same number of filled cells) to see if it already appeared. If this is the case, the third and last loop tries to find numbers matching the pattern of filled cells, such that the columns and rows add up to the correct numbers. Before this, it does figure out a strategy, to fill the cells that need to be filled. The strategy is nothing else than an order in which they are filled. After they are filled, the solution is checked with a new (and much faster) knapsack algorithm.

*Norami: Klaus Mitteldorf Photographs*with photographs by Klaus Mitteldorf, text written by Valdir Zwetsch (in Brazial Portugese, German, and English), edited by Helga Maria Miethke, and published by Rotovision SA in 1989, ISBN:9782880460921.*Szenische Akte: Angelika Vogel*written and photographs by Angelika Vogel written in German published by Verlag Photographie in 1986, ISBN:9783723161005

Program counter | Instruction being fetched | Instruction being execute |

0x0804 | jump to 0x0870 | previous instruction |

0x0805 | jump to 0x0806 | jump to 0x0870 |

0x0870 | load immediate | jump to 0x0806 |

0x0806 | some instruction | load immediate |

Of course, this idea is only usefull when the address of the location of the load immediate instruction (0x0870) can be calculated. There are indeed jump (branch) instructions where this is possible. Note that the load immediate instruction could also be replaced by some other instruction (as long as it is not a jump/branch instruction).

10 set: 10 28 33 38 45 52 53 73 80 81 102 108 115 137 143 150 172 199 200 207 242 252 6 buckets with 420: 45+143+199+33 172+108+102+38 28+242+150 200+73+137+10 252+115+53 80+52+207+81 7 buckets with 360: 172+53+102+33 207+115+38 200+10+150 45+73+242 28+52+81+199 80+137+143 252+108 8 buckets with 315: 45+199+38+33 28+137+150 80+52+81+102 252+53+10 73+242 200+115 172+143 108+207 9 buckets with 280: 52+45+150+33 242+38 115+53+10+102 81+199 137+143 207+73 172+108 80+200 252+28 10 buckets with 252: 108+73+38+33 102+150 242+10 199+53 137+115 28+143+81 207+45 200+52 80+172 252

*Addition Saturday, April 14:* I got an email from Marcel informing me
that I was the first one to have reported the Easter Egg and that even Walter
did not know anything about it.

*Deeltijdopleiding Fine Art Enschede 2011*written in Dutch for € 0.95.*Welchen soll ich nehmen?*written by Eva Heller in German and published by Ullstein in 2003, ISBN:9783550084157, for € 1.95.

When I tried to find an elegant solution on paper, I realized that there was an error in the part of the algorithm that calculated the distance between reoccurences of the same combination of coloured straps. When I corrected the algorithm, it counted 60 solutions with at least seven other combinations between each combination. The solution I had found on paper, was on of the 60 solutions found by the program. I strongly suspect that all solutions are basically the same, with the colours and the starting position permutated, because there are 10 combinations and 3! ways in arranging the neighbours of a certain combination. I wrote a small fragment of JavaScript to calculate, which combination to wear on the coming ten days (from today). (I am not going to publish the program, because it seems I could have figured out everything on paper.)

- 5: Josha Bach's answer to: Are worms and ants conscious, or just unconscious biological machines?
- 6: Stuff in Space
- 18: Machine Theory of Mind
- 20: A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs
- 21: The Geometry Junkyard

Home | March 2018