Implementing timed Petri net for modeling and simulation in card gameplay

Abstract

Petri nets (PNs) are a form of directed graph that can be used to model and simulate systems. They are very useful tool for developing and analyzing algorithms, prior to implementation. Adding the component of time, allows for systems with prioritized actions to be modeled more effectively. This paper assesses a Texas Hold’em algorithm using Petri nets and uses them to develop an improved version of this algorithm. Both are implemented in Python scripts to obtain the results to show which is more effective.