Dining Philosophers

[AW]

This is the MASM version of the known Dining Philosophers problem.
https://en.wikipedia.org/wiki/Dining_philosophers_problem
https://www.slideshare.net/YashMittal3/dining-philosophers-problem

Note that this version is not set to terminate, in order to keep it faithful to its original spirit, so you must press CTRL-C when don't want more.

[dedndave]

i would use a finite state machine   

[zedd151]

i would use a finite state machine   

[off topic]

There's Dave! Long time no see.

[on topic]

Just to keep with the topic, and sound like a bot:

I agree.   

[daydreamer]

nice
@Dave
nonworking CTRL-C and it turns into infinite state machine 

[felipe]

This is really cool. I think you can use this kind of programs to make some gambling programs. You will need to set some limit (like when 1 philosopher has eated all his food). So people can bet who finish first...

[AW]

i would use a finite state machine   

It is an implementation of a FSM, it has to to be.
It is also an implementation of a flowchart and an implementation of some pseudo code that is not there. 

[AW]

nice
nonworking CTRL-C and it turns into infinite state machine 

You must press the power button if everything else fails. 

[AW]

This is really cool. I think you can use this kind of programs to make some gambling programs. You will need to set some limit (like when 1 philosopher has eated all his food). So people can bet who finish first...

The window is open for all sorts of adventures.