Skip to content

Latest commit

 

History

History
40 lines (31 loc) · 1.44 KB

README.md

File metadata and controls

40 lines (31 loc) · 1.44 KB

Beasty bar (Python implementation)

If you don't know the game, have a look at the info at Board Game Geek. Simple card game. 5 card in the queue, several cards in the hand. Players take turn to put the given card on the table. Each of the card have unique action. Who gets most of the cards into the beasty bar wins.

I really like the game and I decided that it would be fun to look at the game.

  • How hard it is to implement the game? (Surprisingly hard, i.e. the queue management was first to me.)
  • What will be the optimal strategy? (I don't know yet.)

Run:

In order to get a single played game for 4 players, run

python safari.py

You should get a log of the single game.
Works with Python 3.10.

Tests:

The logic in the queue is quite complicated and in order to implement that, I tried test driven development. In order to see how the tests work, see pytest.

What is the optimal strategy?

I don't know yet!
My current plan of action is following.

  • create more intuitive interface for players (see players/strategies.py). This interface needs to set several things:
    • which card to choose from hand
    • what action chameleon should play
    • what action parrot should play.

I will create several thousand games and have a look. Then I would like to see:

  • the most successful card at each turn
  • Analyse the most successful strategies
  • Analyse the most successful games