There have been recently complaints that there wasn’t any resource available for bridging the gap between beginner and experimented Haskeller, and some posts on “Haskell program architecture” have been written to help with this transition. I have found these posts to be pretty interesting, and while I can hardly be called an expert, I would like to contribute to this effort by documenting a few advanced Haskell features, as well as my design decisions, applied to a simple, yet fun, project.
Now that this is out of the way, let’s start !
The project
In this series of posts, I will describe how to model the rules of a well known board game, and how to turn them in an
enjoyable program. If time permits, quite a few topics should be discussed, including key design decisions, how to
interface a pure description of the rules with multiple backends, concurrency with the STM
, and the advantage of
always pretty printing your data structures.
The game itself is a shameless clone of the excellent 7 Wonders game (you can find the rules on the official web site), but with Internet giants instead of antique wonders. The theming took me a long time, and I am not particularly satisfied with it, so if you feel like contributing, please give me better names for the cards and resources.
All the code is on github. I will document my decisions and actions as I go, and will tag the repository accordingly. The relevant version for this article is tag Step1.1.
The types
Startups.Base
The Startups.Base module contains all the base
elements of the game, with the relationship with the original game written the comments. While all the types are more or
less directly transcribed from the rules book, the newtype
d numerical types might not be obvious :
1 2 3 4 5 6 7 8 9 10 11 |
|
All the derived instances let you use them just like a standard Integer
in your code, and the newtype
prevents you
from mixing them. But the main advantage is that it will make functions type signatures a lot more informative.
Startups.Cards
I usually would have merged this module with the previous one,
but for the sake of blogging about it I separated the two. This module is all about modeling the cards. Fortunately, the
cards have an obvious representation.
But what about the Effect
type ?
Modeling the effects
With a functional language, there are several ways to go :
- Have some big
case
statements all over the code that depend on the card names, the effects being encoded where they are needed. This is obviously bad, as it will lead to a lot of verbose code, and it will be a pain to refactor the code. - Have the effect described as a state-changing function (ie.
type Effect = PlayerId -> GameState -> GameState
). This is the most versatile option, as it lets you add new cards with funky effects without modifying other parts of the code. Unfortunately, your program no longer have an easy way to “observe” the effect, so you will need to write a human-readable description for each card. It might be hard to write an AI for this game too (this point is debatable). There is also the problem of reasoning about new effects, especially concerning the order of application of the effects. A common workaround is to add a “priority” field, so that the order of application is known. - Fully describe all effects with a data type. This is the approach we are going to take, as it has obvious advantages in this particular case : most cards can be described with a handful of distinct “effect components”, where the components are orthogonal. This means they should be implemented in the part of the code that are relevant. It will be quite easy to describe arbitrary effects to the user too.
All the possible effects components can be seen
here. Some components have no
parameters (such as Recycling
), meaning they model a specific rule. But what is nice about this data type is that it
models the effects of the cards, but also of the company building stages.
Precise types
The following types are not as obvious as they appear :
1 2 3 4 5 6 7 |
|
My first version was something like :
1 2 3 4 |
|
This was simpler, but some effects have no meaning when applied to the current player (such as reduced exchange rates). This will make pattern matching a bit more cumbersome, but it will probably prevent some mistakes.
Modeling the cost
What is more interesting is the Cost
data type.
1 2 |
|
A MultiSet
is a collection of objects that can be repeated but for which order is not important (you can also think of it as a sorted list).
It perfectly models a resource cost, such as “3 operations, and a marketing”, and it provides us with a isSubsetOf
operation that can directly tell
whether a player has enough resources to play some card. There is an obvious Monoid
instance for it :
1 2 3 |
|
I don’t think this instance will be too useful, except for writing this cleanly :
1 2 3 4 5 6 7 8 9 10 11 12 |
|
When the OverloadedStrings
extension is enabled, the compiler will accept strings in places where another type is
expected, by adding a call to the fromString
function. For example, "YYY" :: Cost
will be replaced by fromString "YYY" :: Cost
.
I don’t think this is good practice to advise others to write partial IsString
instances, but it greatly helped with
writing the card list, speaking of which …
Tests
Writing the first card list was the most tedious and error prone part of this endeavor. In order to make sure I did not introduce a typo, I performed a couple of tests on the card list :
- All cards are distinct (got a bug).
- For every number of players and ages, there are 7 cards for each player (there were three errors).
What could have been better
Ord instances
Most data types now have Ord
instances that are not particularly meaningful. They are here so that the data structures
can be used in the standard containers
types, such as Data.Map.Strict
and Data.Set
. It might have been a better
idea to use unordered-containers
, but this would have meant more boilerplate (for deriving all the Hashable
instances).
Why not use an external DSL for describing the cards ?
This indeed would have been a good idea, and wouldn’t have been particularly hard to write. I don’t think it would have added much to the project at this stage though.
Modeling the “Opportunity” effect
This effect currently looks like this : Opportunity (S.Set Age)
. It is used to describe the fact that a given player
can build for free any card, once per age. The Set
will contain the set of Age
s for which this capacity has not been
used. This means that when the player decides to use this capacity, this effect will need to be updated. If this wasn’t
for this effect, a player card list would only be modified by adding a card to it, which would have been more pleasant.
Card and Company stages
When I started writing this post, the Card
type had a single constructor, and there was a CardType
that was not part
of the rules used to describe a company stage. I did that because I thought it was more elegant to unify cards and
company stages, as they were pretty similar (both have costs and effects that work the same way).
It turned out that I had to enter dummy values for player count, age, card name, etc. for these “cards”. Now there is an additional constructor for company building stages, as can be seen in this commit.
Next time
In the next episode, I will start writing the game rules, starting with choosing (or not) the proper abstraction for describing them. In the meantime, do not hesitate commenting (reddit link) !