The bridge-crossing problem is a mathematical puzzle where
a group of N persons have to cross a bridge at night. It is dark and they can only cross the bridge if they carry a lamp. Only one lamp is available and at most two persons can cross at the same time. It is not possible to cross from a side if the lamp is not on that side. The time of crossing is the time of the slowest person crossing.
In this simple exercise, the bridge crossing problem is modelled as
undiscounted Dynamic Programming problem with termination state. I know very little about this problem, and I made this script just for fun I guess other approaches exist which are more computationally efficient than this.
Anyway, this one works and can it be used to solve problems up to 10~15 persons in reasonable time.
I did not check if the file produces the right results, I only looked at the code.
The code does contain sufficient help and even an example. However, it does not have an H1 line meaning that you cannot use 'lookfor' to find the file in the future when you have forgotten the exact filename
It also does not contain any code to check if the input and output arguments are valid.
Furthermore, some code can be improved. Look at the suggestions of the M-lint checker and see if you can change the code.