Find a number
ABCDEFGHIJ such that
A is the count of how many 0's are in the number,
B is the number of 1's, and so on.
(Taken from http://einstein.et.tudelft.nl/~arlet/puzzles/logic.html)
(In reply to
computer solution by Charlie)
First line of each is random digits; then counts begin.
0 0 4 1 1 1 1 0 0 2
4 4 1 0 1 0 0 0 0 0
6 2 0 0 2 0 0 0 0 0
7 0 2 0 0 0 1 0 0 0
7 1 1 0 0 0 0 1 0 0
6 3 0 0 0 0 0 1 0 0
7 1 0 1 0 0 1 0 0 0
6 3 0 0 0 0 0 1 0 0
1 2 1 2 0 0 1 2 0 1
3 4 3 0 0 0 0 0 0 0
7 0 0 2 1 0 0 0 0 0
7 1 1 0 0 0 0 1 0 0
6 3 0 0 0 0 0 1 0 0
7 1 0 1 0 0 1 0 0 0
6 3 0 0 0 0 0 1 0 0
1 3 1 0 0 1 1 1 0 2
3 5 1 1 0 0 0 0 0 0
6 2 0 1 0 1 0 0 0 0
6 2 1 0 0 0 1 0 0 0
6 2 1 0 0 0 1 0 0 0
6 2 1 0 0 0 1 0 0 0
2 2 1 0 0 2 1 1 1 0
3 4 3 0 0 0 0 0 0 0
7 0 0 2 1 0 0 0 0 0
7 1 1 0 0 0 0 1 0 0
6 3 0 0 0 0 0 1 0 0
7 1 0 1 0 0 1 0 0 0
6 3 0 0 0 0 0 1 0 0
0 1 0 1 2 1 0 2 1 2
3 4 3 0 0 0 0 0 0 0
7 0 0 2 1 0 0 0 0 0
7 1 1 0 0 0 0 1 0 0
6 3 0 0 0 0 0 1 0 0
7 1 0 1 0 0 1 0 0 0
6 3 0 0 0 0 0 1 0 0
0 2 0 1 2 0 3 0 2 0
5 1 3 1 0 0 0 0 0 0
6 2 0 1 0 1 0 0 0 0
6 2 1 0 0 0 1 0 0 0
6 2 1 0 0 0 1 0 0 0
6 2 1 0 0 0 1 0 0 0
1 0 0 3 0 2 2 1 0 1
4 3 2 1 0 0 0 0 0 0
6 1 1 1 1 0 0 0 0 0
5 4 0 0 0 0 1 0 0 0
7 1 0 0 1 1 0 0 0 0
6 3 0 0 0 0 0 1 0 0
7 1 0 1 0 0 1 0 0 0
6 3 0 0 0 0 0 1 0 0
1 1 0 2 1 1 3 1 0 0
3 5 1 1 0 0 0 0 0 0
6 2 0 1 0 1 0 0 0 0
6 2 1 0 0 0 1 0 0 0
6 2 1 0 0 0 1 0 0 0
6 2 1 0 0 0 1 0 0 0
1 1 0 1 2 2 1 1 1 0
2 6 2 0 0 0 0 0 0 0
7 0 2 0 0 0 1 0 0 0
7 1 1 0 0 0 0 1 0 0
6 3 0 0 0 0 0 1 0 0
7 1 0 1 0 0 1 0 0 0
6 3 0 0 0 0 0 1 0 0
0 1 0 2 2 0 2 0 1 2
4 2 4 0 0 0 0 0 0 0
7 0 1 0 2 0 0 0 0 0
7 1 1 0 0 0 0 1 0 0
6 3 0 0 0 0 0 1 0 0
7 1 0 1 0 0 1 0 0 0
6 3 0 0 0 0 0 1 0 0
3 0 0 2 1 1 1 0 1 1
3 5 1 1 0 0 0 0 0 0
6 2 0 1 0 1 0 0 0 0
6 2 1 0 0 0 1 0 0 0
6 2 1 0 0 0 1 0 0 0
6 2 1 0 0 0 1 0 0 0
|
|
Posted by Charlie
on 2009-03-30 11:40:33 |
re: computer solution -- examples of convergence
