So there's a class of puzzles called "river crossing puzzles" which involve having to cross a river on a boat/bridge containing some set of individuals/items with restrictions on which ones can be on the boat/left on each shore, right?

and the most common subclass of these problems is the one where you have 3 items/animals to cross with.
This is alternatively called the "fox, goose, and bag of beans" or "wolf, goat, and cabbage" puzzle.
the idea is that your boat can only carry one item at a time, but if you leave the wolf/fox unattended with the goat/goose, the wolf/fox will eat the goat/goose.
and similarly, the goose/goat will eat the beans/cabbage if left alone
so you have to set up a set of actions that never leaves either side of the river in one of the lose-states.
the solution to this variant being:
1. take the goat/goose over
2. return empty
3. take the wolf/fox over
4. return with the goat/goose
5. take the cabbage/beans over
6. return empty
7. take the goat/goose over
the primary trick being that you have to realize that you can take items BACK, and that's the only way to solve it.
and there's a lot of variations on this puzzle, mechanically, like sometimes you can take two items instead of one, and sometimes you can't make a trip empty, and those affect how the relationships between the items have to work to make the puzzle tricky and/or possible.
but the part that always interests me is that ITEMS themselves have endless variations! as you might guess from the fact this puzzle doesn't have a single canonical name and I'm using two variations to describe it.
for the simplest variation (1 item, empty trips allowed) you just need any set of items A, B, and C where A can't be left alone with B, B can't be left alone with C, and there's no obvious reason why A would have interest in C.
So it allows for endless creativity.
wikipedia lists some variations:
* wolf, sheep, cabbage
* fox, chicken, grain
* fox, goose, corn
* panther, pig, porridge
and this puzzle (and the other river-crossing puzzles) dates back to at least the 9th century (that being the earliest example of it that we have), so it's unsurprising that there's so many variations.
every storyteller can mix it up as they like
like this made it into an episode of the Simpsons!
In "Gone Maggie Gone", Homer has to cross a river with Maggie, Santa's Little Helper, and Rat Poison That Looks Like Candy.
So my thought with this puzzle has always been to take it to a silly extent, and research all the cosmetic variations (well, as many as I can find), right?
Come up with a big list of items you might need to boat across a river.
Then figure out how they might interact, and make a randomized metagame of the A->B->C River Crossing Problem.
Either just the 3 item, 1 storage, empties allowed version, or expand it to more items by allowing more storage and varying empties.
but the main amusing bit is that some challenges might be trivial or impossible, depending on which ones you are given.
Like you might have a puzzle where you're a farmer who has
1. a bag of beans
2. a cabbage
3. a panther
and needs to cross the river
well, that one is easy.
beans aren't going to eat cabbage, cabbage isn't going to eat beans, and panthers are carnivores who aren't going to care about beans & cabbages
and you could even build this as a sort of community-sourced system, letting people introduce new items by figuring out their relationships to categories of items.
so you could define items as having tags applying to them, then define relationships between tags.

So, like, you could define [predator] as a tag, and it applies to wolves, foxes, and panthers.
Then you define other items (goats, chickens, geese) as [prey animals]
and then you just define the rule as:
you can't leave a [predator] and a [prey animal] on the same shore unattended.
so then a user could submit a new item: Lion.
Lion is a [predator].

Now you automatically get functionality for the lion, without having to define how lions feel around chickens, geese, and goats.
the fun part of this sort of database game is that it means you can find all the various versions that were implemented in different games and described in stories, and then emulate them in the ABC-river-crossing-puzzle metagame.
with proper tagging you could figure out how to emulate the Maggie, Santa's Little Helper, and Rat Poison That Looks Like Candy puzzle.
anyway, the "randomized metagame of A>B>C river crossing" is the point I wanted to get to with this thread.

but I just found a mistake in wikipedia. Sigh.
OKAY SO remember how I said this is ONE OF the river crossing problems? There are others, which are closely related.
So another two are the "Missionaries and cannibals" puzzle and the "jealous husbands" puzzle.
With the missionaries and cannibals puzzle, you have six items and a 2-capacity boat that cannot move while empty.
The six items are:
3 cannibals
3 missionaries
and in this case the "cannot be left alone" logic is different:
it's instead "cannot be outnumbered".
So cannibals will eat missionaries if at any point there's more cannibals than missionaries on a given shore.
So similarly to the A>B>C puzzle, you have to take items back across to make it work. The solution is a little longer (so I wouldn't include it here) but not fundamentally more complicated.
The Jealous Husbands is a close variation of the Missionaries and Cannibals puzzle but it adds a relationship between the items:
You have three married couples, and no wife can be left alone with another husband unless her husband is also present
so now you have to worry about which items are moving across and which ones they're being left with, instead of just how many of each type you have.
so, why is wikipedia WRONG?
well, you can see that both the "Missionaries & Cannibals" and "Jealous Husbands" puzzles are not the same, mechanically, as the Fox/Goose/Beans-style A>B>C puzzle, right?
well, on the page for A>B>C puzzles they mention some game and shows that include examples of it, and they mention Professor Layton and the Curious Village as having an A>B>C puzzle in it.
Makes sense, that game is an adventure game of puzzle minigames, of course they'd use it!
well let's look up what 3 items it used. lemme check gamefaqs or whatever...
OH LOOK, it uses three wolves and three chicks.
THAT'S NOT AN A>B>C PUZZLE.
THAT'S A MISSIONARIES AND CANNIBALS PUZZLE.
To make things more confusing, in Professor Layton and the Last Specter, the 4th game in the series, they did another river crossing puzzle.
What kind is this one? ehhh...
You have one dog, two cats, and three baby chicks.
The dog can't be left with only one cat, and you have to have more chicks than cats.
The raft holds two animals
So it seems they tried to combine a bit of A>B>C with some Missionaries and Cannibals.
Fundamentally I think it's mostly a Missionaries & Cannibals puzzle, they just expanded it to 3 groups and varied how many items there were in each group (1,2,3 instead of 3,3).
ANYWAY now I gotta figure out if there was more than one river-crossing puzzle in Professor Layton and the Curious Village, and then if not, fix wikipedia.
GOOD NEWS EVERYONE!
There IS another river crossing puzzle (#93) in Curious Village.
It's an A>B>C puzzle, using a Wolf, Sheep, & Cabbage.
although now I have a mistake in the Professor Layton wiki to fix, since they have a category for "River" puzzles, and that category has the two from Curious Village but not the one from Last Specter.
anyway an interesting thought experiment would be to figure out a way to devise a single system that can encompass all three puzzle variations:
A>B>C, Missionaries & Cannibals, and Jealous Husbands.
For completeness, another sort of river crossing puzzle is the Bridge & Torch puzzle:
You have four people who need to cross a bridge over a dangerous river. It's dark and if they don't have a torch, they'll fall off and drown.
The torch will burn out in 15 minutes.
The four people walk at different speeds:
They can cross it in 1 minute, 2 minutes, 5 minutes, and 8 minutes.
If two people cross together, they have to move at the speed of the slower person.
The bridge will collapse if more than 2 people are on it at once, so they can't just all go at once.
So how do you get all 4 people across?
and naturally this puzzle can have the numbers varied to allow for sloppier solutions which'll make it easier.
And you can cosmetically change it up while leaving it mechanically identical.
this one is way more recent than the other three.
Those versions are 1200 years old, this one is known to be at least... 39 years old.
since the others are from the 8th century and this one is from the 80s.
anyway, the solution is, if A=1m, B=2m, C=5m, D=8min:
* A,B cross, taking 2 minutes
* A returns, 1 minute
* C,D cross, taking 8 minutes
* B returns, taking 2 minutes
* A,B cross, taking 2 minutes
2+1+8+2+2: 15 minutes
The interesting variations in this puzzle is that it puts the problem in the time domain, which is harder to reason about for most people (or at least me: I have ADHD, I don't know what the fuck a time is)
and also you have to alternate trips, because the torch has to move.
so you can't just send D across, then C across, then B across, then A across.
Because the torch has to return, and also that'd take too long (8+5+2+1)
Another variation (which I don't see as much analysis of) comes from the same manuscript as the jealous husbands and A>B>C puzzles: it was called "Propositio de viro et muliere ponderantibus plaustrum", which means something like "the puzzle of the weights of a man & woman "

More from foone

You May Also Like