I think this will help:
http://en.wikipedia.org/wiki/Frogger
Consider the roads to be n-laned and of constant width with constant time
traffic coming on each lane.For example,say after 1 minute,a car comes on
each lane but in a arithmetic sequence and not all at same time.To make it
more clear,
A frog has to cross a road to meet
its beloved she-frog at the other end.
The road however has cars coming and
can crush the frog.
Road is two lanes wide.
Devise an algorithm to help the frog carry on its family.
(I am sorry but it seems that I have missed
some parts of the problem here. If som
