The puzzle goes like this: you have a wolf, a goat, and a cabbage and you have to transport all three across a river by boat. As a LEGO minifig serf, you can only carry one passenger in your boat at a time. If you leave the goat and the cabbage unattended, the goat will eat the cabbage. Same deal with the wolf and the goat. What is the fewest number of trips you need to take in order to get all three across the river without anyone being eaten?
Variations of this brain teaser go back over a thousand years, but it took modern-day genius Ciamosław Ciamek to solve the puzzle in LEGO form.
See the solution in beautiful brick-built form after the break!