1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
|
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE Rank2Types #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TemplateHaskell #-}
module Cafp.Game
( PlayerId
, Table (..)
, Player (..)
, Game (..)
, gameCards, gamePlayers, gameNextPlayerId
, newGame
, joinGame
, leaveGame
, processClientMessage
, gameViewForPlayer
) where
import Cafp.Messages
import Control.Lens (Lens', at, ix, orOf, over, to,
(%%=), (%=), (&), (.=), (.~), (^.),
(^..), (^?), _1, _2, _3)
import Control.Lens.TH (makeLenses, makePrisms)
import Control.Monad (guard)
import Control.Monad.State (State, execState, modify, runState,
state)
import Data.Bifunctor (first)
import qualified Data.HashMap.Strict as HMS
import Data.List (sort)
import Data.Maybe (fromMaybe)
import Data.Text (Text)
import qualified Data.Text as T
import qualified Data.Vector as V
import System.Random (StdGen)
import VectorShuffling.Immutable (shuffle)
type PlayerId = Int
type Proposal = [WhiteCard]
data Table
= TableProposing
!BlackCard
!(HMS.HashMap PlayerId Proposal)
| TableVoting
!BlackCard
!(V.Vector (Proposal, [PlayerId]))
!(HMS.HashMap PlayerId Int)
deriving (Show)
data Player = Player
{ _playerName :: !Text
, _playerHand :: !(V.Vector WhiteCard)
, _playerAdmin :: !Bool
} deriving (Show)
data Game = Game
{ _gameCards :: !Cards
, _gameSeed :: !StdGen
, _gameBlack :: ![BlackCard]
, _gameWhite :: ![WhiteCard]
, _gamePlayers :: !(HMS.HashMap PlayerId Player)
, _gameTable :: !Table
, _gameNextPlayerId :: !Int
} deriving (Show)
makePrisms ''Table
makeLenses ''Player
makeLenses ''Game
popCard
:: (Cards -> V.Vector t) -> (Int -> c) -> Lens' Game [c]
-> State Game c
popCard getDeck mk queue = state $ \game -> case game ^. queue of
(x : xs) -> (x, game & queue .~ xs)
[] ->
let deck = game ^. gameCards . to getDeck
idxs = V.imap (\i _ -> mk i) deck
(cs, seed) = first V.toList $ shuffle idxs (game ^. gameSeed) in
case cs of
[] -> error "popCard: Cards are empty"
x : xs -> (x, game & queue .~ xs & gameSeed .~ seed)
popBlackCard :: State Game BlackCard
popBlackCard = popCard cardsBlack BlackCard gameBlack
popWhiteCard :: State Game WhiteCard
popWhiteCard = popCard cardsWhite WhiteCard gameWhite
newGame :: Cards -> StdGen -> Game
newGame cards gen = flip execState state0 $ do
black <- popBlackCard
gameTable .= TableProposing black HMS.empty
where
state0 = Game
{ _gameCards = cards
, _gameSeed = gen
, _gameBlack = []
, _gameWhite = []
, _gamePlayers = HMS.empty
, _gameTable = TableProposing (BlackCard 0) HMS.empty
, _gameNextPlayerId = 1
}
assignAdmin :: Game -> Game
assignAdmin game
-- Admin already assigned.
| orOf (gamePlayers . traverse . playerAdmin) game = game
-- Assign to first player
| (p1 : _) <- sort (game ^. gamePlayers . to HMS.keys) =
game & gamePlayers . ix p1 . playerAdmin .~ True
-- No players
| otherwise = game
joinGame :: Game -> (PlayerId, Game)
joinGame = runState $ do
pid <- gameNextPlayerId %%= (\x -> (x, x + 1))
let name = "Player " <> T.pack (show pid)
hand <- V.replicateM 6 popWhiteCard
gamePlayers %= HMS.insert pid (Player name hand False)
modify assignAdmin
pure pid
leaveGame :: PlayerId -> Game -> Game
leaveGame pid = assignAdmin . over gamePlayers (HMS.delete pid)
blackCardBlanks :: Cards -> BlackCard -> Int
blackCardBlanks cards (BlackCard c) =
maybe 0 (length . T.breakOnAll "\\BLANK") $ cardsBlack cards V.!? c
stepGame :: Game -> Game
stepGame game = case game ^. gameTable of
TableProposing black proposals
| HMS.null ((game ^. gamePlayers) `HMS.difference` proposals) ->
let proposalsMap = HMS.fromListWith (++) $ do
(pid, proposal) <- HMS.toList proposals
pure (proposal, [pid])
(shuffled, seed) = shuffle
(V.fromList $ HMS.toList proposalsMap) (game ^. gameSeed) in
game & gameSeed .~ seed
& gameTable .~ TableVoting black shuffled HMS.empty
| otherwise -> game
TableVoting _ _ _ -> game
processClientMessage :: PlayerId -> ClientMessage -> Game -> Game
processClientMessage pid msg game = case msg of
ChangeMyName name ->
game & gamePlayers . ix pid . playerName .~ name
ProposeWhiteCards cs
-- Bad card(s) proposed, i.e. not in hand of player.
| any (not . (`elem` hand)) cs -> game
-- Proposal already made.
| Just _ <- game ^? gameTable . _TableProposing . _2 . ix pid -> game
-- Not enough cards submitted.
| Just b <- game ^? gameTable . _TableProposing . _1
, blackCardBlanks (game ^. gameCards) b /= length cs -> game
-- All good.
| otherwise -> stepGame $
game & gameTable . _TableProposing . _2 . at pid .~ Just cs
SubmitVote i -> case game ^. gameTable of
TableProposing _ _ -> game
TableVoting _ shuffled votes
-- Vote out of bounds.
| i < 0 || i >= V.length shuffled -> game
-- Already voted.
| pid `HMS.member` votes -> game
-- Can't vote for self.
| pid `elem` snd (shuffled V.! i) -> game
-- Ok vote.
| otherwise -> stepGame $ game
& gameTable . _TableVoting . _3 . at pid .~ Just i
where
hand = game ^.. gamePlayers . ix pid . playerHand . traverse
gameViewForPlayer :: PlayerId -> Game -> GameView
gameViewForPlayer self game =
let opponents = do
(pid, p) <- HMS.toList $ game ^. gamePlayers
guard $ pid /= self
let ready = case game ^. gameTable of
TableProposing _ proposals -> HMS.member pid proposals
TableVoting _ _ votes -> HMS.member pid votes
pure $ Opponent (p ^. playerName) (p ^. playerAdmin) ready
player = game ^. gamePlayers . at self
table = case game ^. gameTable of
TableProposing black proposals ->
Proposing black . fromMaybe [] $ HMS.lookup self proposals
TableVoting black shuffled votes -> Voting
black
(fst <$> V.toList shuffled)
(fromMaybe 0 $ V.findIndex ((self `elem`) . snd) shuffled)
(HMS.lookup self votes) in
GameView
{ gameViewOpponents = opponents
, gameViewMyName = maybe "" (^. playerName) player
, gameViewTable = table
, gameViewHand = player ^.. traverse . playerHand . traverse
}
|
