B Set 66 Unknown

This page uses a content type that does not have a custom renderer yet. Raw structured data is shown below.

{
    "title": "Expert River Crossing Puzzle #66",
    "scenario": "Monks at the River",
    "narrative": "An elder monk and two young monks must cross a river. The boat can carry only 1 adult or up to 2 young monks.",
    "entities": [
        {
            "id": "m1",
            "name": "Elder Monk",
            "icon": "🧘"
        },
        {
            "id": "m2",
            "name": "Young Monk A",
            "icon": "🧒"
        },
        {
            "id": "m3",
            "name": "Young Monk B",
            "icon": "🧒"
        }
    ],
    "boatCapacity": 1,
    "constraints": [
        "The boat can carry either 1 adult or 2 children.",
        "At least one person must row the boat.",
        "The elder monk cannot be left alone on a bank with both young monks unsupervised across the river."
    ],
    "question": "Describe a valid sequence of crossings that gets everyone to the other side without violating any constraint. What is the minimum number of trips required?",
    "solution": [
        {
            "trip": 1,
            "direction": "→",
            "carrying": [
                "Young A",
                "Young B"
            ],
            "leftBank": "Elder",
            "rightBank": "Young A,Young B",
            "note": "Both young monks cross."
        },
        {
            "trip": 2,
            "direction": "←",
            "carrying": [
                "Young A"
            ],
            "leftBank": "Elder,Young A",
            "rightBank": "Young B",
            "note": "Young A returns."
        },
        {
            "trip": 3,
            "direction": "→",
            "carrying": [
                "Elder"
            ],
            "leftBank": "Young A",
            "rightBank": "Elder,Young B",
            "note": "Elder crosses."
        },
        {
            "trip": 4,
            "direction": "←",
            "carrying": [
                "Young B"
            ],
            "leftBank": "Young A,Young B",
            "rightBank": "Elder",
            "note": "Young B returns."
        },
        {
            "trip": 5,
            "direction": "→",
            "carrying": [
                "Young A",
                "Young B"
            ],
            "leftBank": "",
            "rightBank": "All",
            "note": "Both young monks cross. Done!"
        }
    ],
    "minimumTrips": 5,
    "hint": "No hints are provided for this difficulty. Find the full solution on your own.",
    "partialSolutionHint": [],
    "_archetype": null,
    "_generatorId": null
}