Show simple item record

dc.contributor.authorHope, Garretten_US
dc.contributor.authorBrodhead, Paulen_US
dc.contributor.authorKim, Seung-yunen_US
dc.date.accessioned2022-05-25T15:36:31Z
dc.date.available2022-05-25T15:36:31Z
dc.date.issued2020-03-09
dc.identifier.citationGarrett Hope, Paul Bradhead and Seung-yun Kim. “Implementing Timed Petri net for Modeling and Simulation in Card Gameplay.” Proceedings of 35th ISCA International Conference on Computers and Their Application, 2020, pp. 297-306.en_US
dc.identifier.issn2398-7340
dc.identifier.urihttps://doi.org/10.29007/htqb
dc.descriptionDepartment of Electrical and Computer Engineeringen_US
dc.description.abstractPetri 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.en_US
dc.language.isoen_USen_US
dc.publisherEasyChairen_US
dc.titleImplementing timed Petri net for modeling and simulation in card gameplayen_US
dc.typeArticleen_US
dc.typeConference Publicationen_US
dc.typeTexten_US
prism.publicationNameProceedings of 35th ISCA International Conference on Computers and Their Applicationen_US
prism.publicationNameEPiC Series in Computingen_US
prism.volume69
prism.startingPage297
prism.endingPage306
dc.identifier.doi10.29007/htqb


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record