2 ms·
The first problem is that the author assumes that the only way the computer can solve the problem is using brute force, and perhaps that's the main problem. Wi
by gus_massa 5y ago
The first problem is that the author assumes that the only way the computer can solve the problem is using brute force, and perhaps that's the main problem.
With brute force, you need (24^12)*11! ~= 1.5E24 as described.
Another solution is tu use OpenCV to segment the image, look at the pixels in the border of each border, and find the matches. The number of borders is 12*6*4, and to try all the matches you need only (24*6*4)^2 ~= 3.3E5 (perhaps you can divide that by 2) And perhaps in O(Nlog(N)) using a hast table, but the differences between matching borders and error in the image may be a problem to get a good hash code. Anyway, a computer can try (24*6*4)^2 ~= 3.3E5 in less than a second, that is like 200 faster than the time the author used to solve the puzzle.
The second error is that the author assumes that if a computer uses a robotic arm, it will try to move all the cubes to all the possible positions. But in a realistic scenario, the computer will use the arm to see all the faces of the cube, memorize them, use less than a second to get the correct solution, and then move the cubes once to the correct position. I guess 10 seconds. I strongly recommend to watch https://youtu.be/GJKdbGAF9H0?t=270 https://youtu.be/GJKdbGAF9H0?t=270
Nest there is a jump from the puzzle to evolution. For example in "How long and complicated is the DNA?" Finding the correct sequence for the DNA of humans (or something similar enough, or at least alive) using brute force would take a long time, longer than the estimated age of the universe. Nobody disagree with that. The problem is that there are alternative algorithms. The idea is that the first DNA was much smaller (and perhaps RNA), and it grow slowly, trying small variations and most of the times removing the bad ones and keeping the good ones. It's more similar to a parallelized branch and prune, that a simple brute force approach.
- deep_lifeguard 5y agoHello Gus, You have forgotten how openCV works. You need to input matrixes. So lets say you have to solve the puzzle, how are you going to sample it? Infact I think, the author was being generous in letting every different arrangement being just 1FLOP. Lets say you scanned the image at 300dpi, then each piece of the puzzle would take 90,000 FLOPS to compute (if you didn't reduce the each matrix). Anyway, the reason the author jumped from the puzzle to the conclusion of evolution is bogus is because lots of puzzles were solved on the earth before an intelligent functioning human being and other creatures and other things happened.. Also, happy to be proven wrong. But this is a 3*4 picture puzzle so lets not do an n terminology. What would be your revised answer with the matching borders code? Also, lets say for fun you have a black and white picture puzzle. Lets battle it out!