Instructions:
1. Processes need two resources (forks 🥄) to process data when hungry.
2. Click forks to assign or release them (red = in use).
3. Keep processes active to avoid failure (game over after 60 seconds of hunger).
4. Avoid deadlock: when all processes are hungry and waiting, the game ends.
5. Earn 10 points per cycle and advance levels for faster challenges. Tip: Assign both forks to a hungry process to let it run! Why It Matters: This game simulates concurrent systems where processes (like threads or programs) compete for shared resources (like mutex locks). Mismanaging forks can cause deadlock or starvation, just like in real systems!
Score: 0
Time: 0s
Level: 1
Learn More:
The Dining Philosophers problem models concurrent systems where processes compete for shared resources. Each process (🧑💻) needs two forks (🥄) to proceed, similar to threads needing locks or memory. A deadlock happens when all processes hold one resource and wait for another, causing a freeze. Starvation occurs when a process never gets both resources. Pro Tip: Prioritize hungry processes and release forks promptly to maintain system flow!