This project contains an algorithm that, given the cards of two players, calculates how many rounds it took a player to win the game. Basically, the algorithm simulates a two-players Beggar-My-Neighbour game.
I want to find an infinite game: this happens when, after some rounds, the deck of both players is equal to the one they had at the start. But since there are ~10^20 possible games, I can't test all of them, so I want to use evolution to get longer games and maybe find an infinite one
-
Notifications
You must be signed in to change notification settings - Fork 0
This program looks for an infinite game of the completely random card game "Beggar My Neighbour". https://en.wikipedia.org/wiki/Beggar-my-neighbour
Stypox/beggar-my-neighbour
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
This program looks for an infinite game of the completely random card game "Beggar My Neighbour". https://en.wikipedia.org/wiki/Beggar-my-neighbour
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published