Algorithms: The Orange Game
Routing & Deadlock in Networks
Routing & Deadlock in Networks
When you have a lot of people using one resource (such as cars using roads, or messages getting through the Internet), there is the possibility of “deadlock”. A way of working co-operatively is needed to avoid this happening.
Can you solve the problem below and move each orange back to it's correct position?
There are nine orange sprites; two sprites are labeled A, B,C, D, while only one sprite is labeled E. The background has an area labeled with each one of these letters. The nine orange sprites are placed in random order next to the five areas; four areas will have two oranges while one area will have only one orange.
Click on an orange to move it to the empty position; it must be in an area adjacent to the area with only one orange, otherwise the cat will complain and the orange will not move. When all oranges are in the correct area, the cat will announce that you have solved the problem.
References & Additional Resources
