How do you solve the Dining Philosophers problem without deadlock?

Five philosophers, five forks, each needs two adjacent forks to eat. Deadlock if all pick left fork simultaneously. Solutions: Allow at most 4 philosophers to sit (resource hierarchy), Pick up forks only if both available (all-or-nothing), Odd philosophers pick left first, even pick right (asymmetric), Use a waiter/arbitrator (centralized), Chandy/Misra solution (message-passing). Each demonstrates different deadlock prevention strategies applicable to real systems.