In the lecture ‘Virtual Presence’ in my university
we had something to contribute to the topic edutainment in Second Life.
I had chosen the task to illustrate backtracking.
In addition I have created an object that creates a lattice of islands,
which may be connected by bridges.
One island is defined as a start and one as a target.
Now you could make a turtle, on which you could sit on,
run through the island maze.
It has taken on the backtracking scheme and gradually scanned
all islands and marked dead ends red until it found the target isle.
This was written in the Second Life “language” LSL
(Linden Scripting Language).

“Backtracking is a general algorithm for finding all
(or some) solutions to some computational problem,
that incrementally builds candidates to the solutions,
and abandons each partial candidate c (“backtracks”)
as soon as it determines that c cannot possibly be completed
to a valid solution.”

9.6KB (From this server)

9.6KB (From Jimdoo)

9.6KB (From Dropbox)