This problem (and solution) with 5 camels each was posted here on Puzzling several years ago:
Two merchants have 5 camels each. One fine day, one of the merchants sells all of his goods in the market and heads back to the village. He has to cross a bridge to reach his destination, and the bridge is only wide enough for 1 camel at a time.
At the same time, the other merchant is heading to the market to sell his goods and must cross the same bridge. Alas! They meet up in the middle of the bridge one camel-length from each other. They are both stubborn and won't back up their camels. Fortunately, the first merchant's camels are spry and unladen and are able to jump over another camel. Can both merchants get their camels across the bridge? (Both merchants' camels can jump)
The accepted answer offers two solutions, the first of which - 'a)' - goes as follows:
XXXXX_OOOOO XXXX_XOOOOO XXXXOX_OOOO XXXXOXO_OOO XXXXO_OXOOO XXX_OXOXOOO XX_XOXOXOOO XXOX_XOXOOO XXOXOX_XOOO XXOXOXOX_OO XXOXOXOXO_O XXOXOXO_OXO XXOXO_OXOXO XXO_OXOXOXO X_OXOXOXOXO _XOXOXOXOXO OX_XOXOXOXO OXOX_XOXOXO OXOXOX_XOXO OXOXOXOX_XO OXOXOXOXOX_ OXOXOXOXO_X OXOXOXO_OXX OXOXO_OXOXX OXO_OXOXOXX O_OXOXOXOXX OO_XOXOXOXX OOOX_XOXOXX OOOXOX_XOXX OOOXOXOX_XX OOOXOXO_XXX OOOXO_OXXXX OOO_OXOXXXX OOOO_XOXXXX OOOOOX_XXXX OOOOO_XXXXX
Question: Can this solution be extended to arbitrarily many camels?