Given n marbles arrayed in a square with n+1 slots(slot n+1 being empty(labelled with numbers from 1 to n+1) you have to bring them all from their orginal positions to a position in whcih bringing them back woudl take the most moves. The rule is to move each marble to the adjacent square.(adsbygoogle = window.adsbygoogle || []).push({});

I'm really not sure as to how to solve it. I'm really just doing this because I saw it and the fact that i don't know the solution is killing me.

\

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Discret mathematics problem

**Physics Forums | Science Articles, Homework Help, Discussion**