Hacker News new | past | comments | ask | show | jobs | submit login

My first thought for “can’t generalize over number of players” was that he could write code that emits a PRISM program…



Passing the state from n to n-1 players is harder.


I think I can do that with having an action for each player that passes if they don't have any money. The tricky bit is implementing the ante logic to only add n-1 coins to the pot, but I have an idea on how to hardcode that. After that it's "just" a matter of generating it all with another program.


This is also what I did when I used PRISM for my thesis. Honestly also not the greatest experience, but I think it does show that the limitations of the PRISM language are not inherent to the problem domain.




Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: