I have to write a solution code for dining philosophers problem
i will take the PHILOSOPHERS as threads and every philosophers has 3 states, such as THINKING, EATING and HUNGRY.
The main condition is;
The philosopher i can eat only if his left and right (philosopher i-1 & philosopher i+1) neighbors are not in EATING state.
My problem is i couldn't start to coding, i could not designate its starting point, please give me some advice about it