forked from derekmcloughlin/craft
-
Notifications
You must be signed in to change notification settings - Fork 0
/
chapter-06.hs
982 lines (659 loc) · 27.5 KB
/
chapter-06.hs
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
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
import Pictures
import Test.QuickCheck
import Test.HUnit
-- Exercise 6.1
{-
snd :: (a, b) -> b
snd (x, y) = y
sing :: a -> [a]
sing x = [x]
-}
-- Exercise 6.2
{-
somefunc :: [[a]] -> [[a]]
Not the most generic, because it needs it's input to be an array of arrays
-}
-- Exercise 6.3
shift :: ((a, a), a) -> (a, (a, a))
shift ((x, y), z) = (x, (y, z))
-- Exercise 6.4
-- NOTE: because we're importing Pictures I'm renaming the following functions
superimposeChar' :: Char -> Char -> Char
superimposeChar' ch1 ch2
| ch1 == '.' && ch2 == '.' = '.'
| otherwise = '#'
-- Exercise 6.5
superimposeLine' :: [Char] -> [Char] -> [Char]
superimposeLine' line1 line2 = [superimposeChar' ch1 ch2 | (ch1, ch2) <- zip line1 line2]
-- Exercise 6.6
superimpose' :: Picture -> Picture -> Picture
superimpose' pic1 pic2 = [superimposeLine' line1 line2 | (line1, line2) <- zip pic1 pic2]
-- Exercise 6.7
printPicture' :: Picture -> IO ()
printPicture' pic = putStr $ onSeparateLines pic
where onSeparateLines xs = [ch | x <- xs, ch <- x ++ "\n"]
-- Exercise 6.8
-- Test picture
testPic :: Picture
testPic = [ "a.X.b",
".....",
".....",
"Q...Z",
".....",
".....",
"d.P.c"]
rotate90 :: Picture -> Picture
rotate90 pic = flipV [ [xs !! i | xs <- pic] | i <- [0 .. length (pic!!0) - 1]]
-- Exercise 6.9
rotate90anti :: Picture -> Picture
rotate90anti pic = rotate90 $ rotate90 $ rotate90 pic
-- Exercise 6.10
-- Helper
scaleLineH :: String -> Int -> String
scaleLineH line n = concat [ replicate n ch | ch <- line]
-- Horizontal scaling
scaleH :: Picture -> Int -> Picture
scaleH pic n = [scaleLineH line n | line <- pic]
scaleV pic n = concat [ replicate n line | line <- pic]
scale pic n = scaleV (scaleH pic n) n
-- A madder way to do all this is to use the scaleH and rotate90 functions:
scale' :: Picture -> Int -> Picture
scale' pic n = rotate90 $ rotate90 $ rotate90 $ scaleH (rotate90 $ scaleH pic n) n
-- Exercise 6.11
testPic2 :: Picture
testPic2 = [ "A.x.B",
".....",
".....",
"q...z",
".....",
".....",
"D.p.C"]
prop_AboveFlipH_Fails :: Picture -> Picture -> Bool
prop_AboveFlipH_Fails pic1 pic2 =
flipH (pic1 `above` pic2) == (flipH pic1) `above` (flipH pic2)
prop_AboveFlipH_Works pic1 pic2 =
flipH (pic1 `above` pic2) == (flipH pic2) `above` (flipH pic1)
-- Exercise 6.12
prop_BesideFlipV_Works :: Picture -> Picture -> Bool
prop_BesideFlipV_Works pic1 pic2 =
flipV (pic1 `beside` pic2) == (flipV pic2) `beside` (flipV pic1)
prop_BesideFlipH_Works :: Picture -> Picture -> Bool
prop_BesideFlipH_Works pic1 pic2 =
flipH (pic1 `beside` pic2) == (flipH pic1) `beside` (flipH pic2)
-- Exercise 6.13
prop_FourPics :: Picture -> Bool
prop_FourPics pic =
(pic `above` pic) `beside` (pic `above` pic) ==
(pic `beside` pic) `above` (pic `beside` pic)
-- Exercise 6.14
{-
The following test will cause quickCheck to give up, as a lot of it's generated
test cases won't match the conditions.
See http://stackoverflow.com/questions/12884927/conditional-quickcheck-properties
-}
prop_rotate90 :: Picture -> Property
prop_rotate90 pic =
(rectangular pic && width pic > 0)
==>
pic == (rotate90 $ rotate90 $ rotate90 $ rotate90 pic)
-- Exercise 6.15
-- This only works if the picture is monochrome - only has '.' or '#'
prop_InvertColour' :: Picture -> Bool
prop_InvertColour' pic =
pic == (invertColour $ invertColour pic)
-- Exercise 6.16
nonRectangularPic :: Picture
nonRectangularPic = ["...", "###", "."]
rectangular' :: Picture -> Bool
rectangular' pic = and [(length line == n) | line <- pic]
where n = width pic
propAboveBeside3Correct w e =
(rectangular w && rectangular e && height w == height e)
==>
(w `beside` e) `above` (w `beside` e)
==
(w `above` w) `beside` (e `above` e)
propAboveBeside4 w e =
(rectangular w && rectangular e && height w == height e)
==>
(w `beside` w) `above` (e `beside` e)
==
(w `above` e) `beside` (w `above` e)
-- Exercise 6.17
testPic3 :: Picture
testPic3 = [ "XXXXXXXXXXXXXX",
"XXXXXXXXXXXXXX",
"XXXXXXXXXXXXXX",
"XXXXXXXXXXXXXX",
"XXXXXXXXXXXXXX",
"XXXXXXXXXXXXXX",
"XXXXXXXXXXXXXX",
"XXXXXXXXXXXXXX",
"XXXXXXXXXXXXXX",
"XXXXXXXXXXXXXX"]
blankPic :: Int -> Int -> Picture
blankPic w h = replicate h $ replicate w '.'
padPicture :: Picture -> Int -> Int -> Picture
padPicture pic w h
| width pic >= w && height pic >= h = pic
| otherwise = pic `beside` blankPic (w - width pic) (height pic)
`above`
blankPic w1 (h - height pic)
where w1 = max w (width pic)
h1 = max h (height pic)
beside2 :: Picture -> Picture -> Picture
beside2 pic1 pic2 = (padPicture pic1 w h) `beside` (padPicture pic2 w h)
where w = min (width pic1) (width pic2)
h = max (height pic1) (height pic2)
above2 :: Picture -> Picture -> Picture
above2 pic1 pic2 = (padPicture pic1 w h) `above` (padPicture pic2 w h)
where w = max (width pic1) (width pic2)
h = min (height pic1) (height pic2)
-- Exercise 6.18
weirdPic :: Picture
weirdPic = [ "XXXXX",
"YYYYYYYYY",
"ZZ",
"W",
"PPPPP"]
padLine :: String -> Int -> String
padLine s n
| n <= length s = s
| otherwise = s ++ replicate (n - length s) '.'
maxWidth :: Picture -> Int
maxWidth pic
| pic == [] = 0
| otherwise = max (length $ head pic) (maxWidth $ tail pic)
makeRectangular :: Picture -> Picture
makeRectangular pic = [ padLine line n | line <- pic]
where n = maxWidth pic
beside3 :: Picture -> Picture -> Picture
beside3 pic1 pic2 = (makeRectangular pic1) `beside2` (makeRectangular pic2)
above3 :: Picture -> Picture -> Picture
above3 pic1 pic2 = (makeRectangular pic1) `above2` (makeRectangular pic2)
-- Exercise 6.19
type Picture2 = [[Bool]]
horse2 :: Picture2
horse2 = [[False, False, False, False, False, False, False, True , True , False, False, False],
[False, False, False, False, False, True , True , False, False, True , False, False],
[False, False, False, True , True , False, False, False, False, False, True , False],
[False, False, True , False, False, False, False, False, False, False, True , False],
[False, False, True , False, False, False, True , False, False, False, True , False],
[False, False, True , False, False, False, True , True , True , False, True , False],
[False, True , False, False, False, False, True , False, False, True , True , False],
[False, False, True , False, False, False, True , False, False, False, False, False],
[False, False, False, True , False, False, False, True , False, False, False, False],
[False, False, False, False, True , False, False, True , False, False, False, False],
[False, False, False, False, False, True , False, True , False, False, False, False],
[False, False, False, False, False, False, True , True , False, False, False, False]]
printChar :: Bool -> Char
printChar b
| b == True = '#'
| otherwise = '.'
printLine :: [Bool] -> String
printLine line = [printChar b | b <- line] ++ "\n"
printPicture2 :: Picture2 -> IO ()
printPicture2 pic = putStr $ concat [printLine line | line <- pic]
-- Exercise 6.20
-- Picture as a list of columns
type PictureCol = [String]
horse3 :: PictureCol
horse3 = [ "............",
".....#......",
"....#.###...",
"...#.....#..",
"..#......#..",
".#........#.",
"#...####..#.",
"####..#....#",
"......#....#",
".....#....#.",
".....#####..",
"............"]
-- This makes it very tricky to do normal operations like print.
-- Effectively we've pivoted or rotated the horse.
-- The function 'above' is really like 'beside' and vice versa.
-- Exercise 6.21
-- For example: the code here is very similar to rotate90
printPictureCol :: PictureCol -> IO ()
printPictureCol pic = putStr $ onSeparateLines $
flipH [ [xs !! i | xs <- pic] | i <- [0 .. length (pic!!0) - 1]]
where onSeparateLines xs = [ch | x <- xs, ch <- x ++ "\n"]
-- Exercise 6.22
type Picture4 = String
horse4 :: Picture4
horse4 = ".......##...\n.....##..#..\n...##.....#.\n..#.......#.\n..#...#...#.\n..#...###.#.\n.#....#..##.\n..#...#.....\n...#...#....\n....#..#....\n.....#.#....\n......##...."
-- This is easy
printPicture4 :: Picture4 -> IO ()
printPicture4 pic = putStr pic
-- Everything else is much harder. Effectively you'd split the strings anyway to
-- make them easier to deal with.
-- Exercise 6.23
-- RLE
type PictureRLE = [[(Int, Char)]]
horse5 :: PictureRLE
horse5 = [
[(7, '.'), (2, '#'), (3, '.')],
[(5, '.'), (2, '#'), (2, '.'), (1, '#'), (2, '.')],
[(3, '.'), (2, '#'), (5, '.'), (1, '#'), (1, '.')],
[(2, '.'), (1, '#'), (7, '.'), (1, '#'), (1, '.')],
[(2, '.'), (1, '#'), (3, '.'), (1, '#'), (3, '.'), (1, '#'), (1, '.')],
[(2, '.'), (1, '#'), (3, '.'), (3, '#'), (1, '.'), (1, '#'), (1, '.')],
[(1, '.'), (1, '#'), (4, '.'), (1, '#'), (2, '.'), (2, '#'), (1, '.')],
[(2, '.'), (1, '#'), (3, '.'), (1, '#'), (5, '.')],
[(3, '.'), (1, '#'), (3, '.'), (1, '#'), (4, '.')],
[(4, '.'), (1, '#'), (2, '.'), (1, '#'), (4, '.')],
[(6, '.'), (2, '#'), (4, '.')]
]
printPictureRLE :: PictureRLE -> IO ()
printPictureRLE pic = putStr $ concat [concat [ replicate n ch | (n, ch) <- line] ++ "\n" | line <- pic]
-- flipV and flipH are exactly the same
flipVRLE :: PictureRLE -> PictureRLE
flipVRLE pic = map reverse pic
flipHRLE :: PictureRLE -> PictureRLE
flipHRLE pic = reverse pic
-- 'above' is the same as the non-RLE version
aboveRLE :: PictureRLE -> PictureRLE -> PictureRLE
aboveRLE = (++)
-- 'beside *can* be the same as the non-RLE version
-- However it's not optimised - see exercise 6.24
besideRLE :: PictureRLE -> PictureRLE -> PictureRLE
besideRLE = zipWith (++)
-- Exercise 6.24
-- compact the RLE
type LineRLE = [(Int, Char)]
testLineRLE :: LineRLE
testLineRLE = [(3, '.'), (4, '#'), (2, '#'), (7, '.')]
stringToRLE :: String -> LineRLE
stringToRLE s = str_acc [] s
-- TODO: There's probably a better way to write this using an apply function.
str_acc :: [Char] -> [Char] -> LineRLE
str_acc chs xs
| xs == [] = [(length chs, head chs)]
| chs == [] = str_acc [head xs] (tail xs)
| head xs == head chs = str_acc (chs ++ [head xs]) (tail xs)
| otherwise = [(length chs, head chs)] ++ (str_acc [] xs)
rleToString :: LineRLE -> String
rleToString line = concat [ replicate n ch | (n, ch) <- line]
compactLineRLE :: LineRLE -> LineRLE
compactLineRLE line = stringToRLE $ rleToString line
compactPictureRLE :: PictureRLE -> PictureRLE
compactPictureRLE pic = [compactLineRLE line | line <- pic]
-- TODO: Could use a similar approach in str_acc to compact without
-- having to go through intermediate string steps
-- This leads us to a compacted 'beside'
besideRLE' :: PictureRLE -> PictureRLE -> PictureRLE
besideRLE' pic1 pic2 = compactPictureRLE $ zipWith (++) pic1 pic2
-- Exercise 6.25
-- Quickcheck properties
-- They should all be the same?
-- Exercise 6.26
type PictureRLE2 = (Int, [(Int, Char)])
-- Exercise 6.27
-- TODO
-- Exercise 6.28
-- TODO
-- Exercise 6.29
type Position = (Int, Int)
type Image = (Picture, Position)
makeImage :: Picture -> Position -> Image
makeImage pic pos = (pic, pos)
-- Exercise 6.30
changePosition :: Image -> Position -> Image
changePosition (pic, pos) newpos = (pic, newpos)
-- Exercise 6.31
moveImage :: Image -> Int -> Int -> Image
moveImage (pic, (x, y)) xMove yMove = (pic, (x + xMove, y + yMove))
-- Exercise 6.32
printImage :: Image -> IO ()
printImage (pic, (x, y)) = printPicture pic
-- x and y?
-- Exercise 6.33
flipImageH :: Image -> Image
-- TODO
flipImageH (pic, (x, y)) = (pic, (x, y))
-- Exercise 6.34
-- TODO
-- Exercise 6.35
-- TODO
-- Exercise 6.36
-- TODO
-- Exercise 6.37
-- TODO
-- Exercise 6.38
-- TODO
-- Exercise 6.39
type Name = String
type Price = Int
type BillType = [(Name, Price)]
formatPence :: Price -> String
formatPence n = (show pounds) ++ "." ++ (pad0 pence )
where pounds = n `div` 100
pence = n `mod` 100
pad0 p = if p < 10 then
"0" ++ show (p)
else
show p
-- Exercise 6.40
formatLine :: (Name, Price) -> String
formatLine (name, price) = name ++ replicate n '.' ++ priceStr ++ "\n"
where n = 30 - (length name) - (length priceStr)
priceStr = formatPence price
-- Exercise 6.41
-- Some test lines
testLines :: [(Name, Price)]
testLines = [ ("Dry Sherry, 1lt", 540),
("Wet Sherry, 2lt", 1234),
("Pink Lemonade, 3lt", 403)]
formatLines :: [(Name, Price)] -> String
formatLines lines = concat [formatLine line | line <- lines]
-- Exercise 6.42
makeTotal :: BillType -> Price
makeTotal bill = sum [price | (_, price) <- bill]
-- Exercise 6.43
formatTotal :: Price -> String
formatTotal price = "\n" ++ formatLine ("Total", price)
-- Exercise 6.44
centre :: Int -> String -> String
centre w s = replicate left '.' ++ s ++ replicate right '.'
where
n = length s
left = (w - n) `div` 2
right = w - (n + left)
formatBill :: BillType -> String
formatBill bill = header ++ (formatLines bill) ++ (formatTotal $ makeTotal bill)
where header = "\n\n" ++ (centre 30 "Haskell Stores") ++ "\n\n"
-- Exercise 6.45
type Database = [(Barcode, Name, Price)]
type Barcode = String
{- Note: it's important to give the testDB its type.
If you just have the data without the type then
the type of testDB is
[([Char], [Char], Integer)]
and you'll get a type error in the "look" function.
-}
testDB :: Database
testDB = [
("1111", "Dry Sherry, 1Lt", 540),
("2222", "Wet Sherry ,2Lt", 1234),
("3333", "Pink Lemonade, 3Lt", 403)
]
look :: Database -> Barcode -> (Name, Price)
look db barcode = head $ [(name, price) | (foundBarcode, name, price) <- db, foundBarcode == barcode]
++ [("Unknown Item", 0)]
-- Exercise 6.46
lookup' :: Barcode -> (Name, Price)
lookup' barcode = look testDB barcode
-- Exercise 6.47
type TillType = [Barcode]
testTill :: TillType
testTill = ["1111", "2222", "3333", "1111", "4444"]
makeBill :: TillType -> BillType
{- I originally had this:
makeBill tillInfo = [(name, price) | barcode <- tillInfo, (name, price) <- lookup' barcode]
However, I was getting type errors on the return of lookup':
Couldn't match expected type `[t0]'
with actual type `(Name, Price)'
In the return type of a call of lookup'
In the expression: lookup' barcode
In a stmt of a list comprehension: (name, price) <- lookup' barcode
This is because <- is expecting an array of things, not just a single thing.
-}
makeBill tillInfo = [lookup' barcode | barcode <- tillInfo]
-- Exercise 6.48
makeDiscount :: BillType -> Price
makeDiscount bill
| numSherries > 1 = 100
| otherwise = 0
where numSherries = sum [ 1 | (name, _) <- bill, name == "Dry Sherry, 1Lt"]
formatDiscount :: Price -> String
formatDiscount price
| price > 0 = "\n" ++ formatLine ("Discount", price)
| otherwise = ""
formatBill' :: BillType -> String
formatBill' bill = header ++
(formatLines bill) ++
(formatDiscount $ makeDiscount bill) ++
(formatTotal $ makeTotal bill)
where header = "\n\n" ++ (centre 30 "Haskell Stores") ++ "\n\n"
-- Exercise 6.49
addBarcode :: Database -> Barcode -> (Name, Price) -> Database
-- Naive version - just add
-- addBarCode db barcode (name, price) = [(barcode, name, price)] ++ db
addBarcode db barcode (name, price) = [(barcode, name, price)] ++
removeBarcode db barcode
removeBarcode :: Database -> Barcode -> Database
removeBarcode db barcode = [(bc, name, price) | (bc, name, price) <- db, bc /= barcode]
-- Exercise 6.50
{- Done as a change to the formatLines function:
formatLines lines = concat [formatLine (name, price) | (name, price) <- lines, name /= "Unknown Item"]
-}
-- Exercise 6.51
-- Testing with QuickCheck
-- Exercise 6.52
-- Project - harder
-- Exercise 6.53
data Suit = Clubs | Diamonds | Hearts | Spades
deriving (Show, Eq, Ord, Enum)
-- Note: the ordering here is increased value
data Value = Two |
Three |
Four |
Five |
Six |
Seven |
Eight |
Nine |
Ten |
Jack |
Queen |
King |
Ace
deriving (Show, Eq, Ord, Enum)
type Card = (Suit, Value)
type Deck = [Card]
-- Really only have 52 distinct entries in a deck. We could hard-code these
-- or use a list comprehension to do it.
fullDeck :: Deck
fullDeck = [(suit, value) | suit <- [Clubs .. Spades], value <- [Two .. Ace]]
-- Exercise 6.54
{- Rationale for choices in previous exercise
A data type is better than strings in this case.
The suits are often ordered in games like Bridge.
The values are a finite set and have an ordering.
-}
-- Exercise 6.55
data Player = North | East | West | South
deriving (Show, Eq)
-- Exercise 6.56
type Trick = [(Player, Card)]
-- The first item in the trick is the lead
testTrick :: Trick
testTrick = [(North, (Clubs, Seven)),
(East, (Spades, Ten)),
(South, (Hearts, Two)),
(West, (Clubs, Nine))]
-- Exercise 6.57
-- No Trumps
-- The first suit lead is effectly the trumps
-- Look to see who played the highest card in that suit
-- I've redefined this in terms of the more generic winT
winNT :: Trick -> Player
winNT trick = winT trumpSuit trick
where trumpSuit = suitLead trick
-- Exercise 6.58
-- Trumps - If there were trumps played, look for the highest one
-- Otherwise it's effectively a no-trumps game - so the trump is the first suit lead.
winT :: Suit -> Trick -> Player
winT trumpSuit trick = whoPlayed
where hasTrumps = length [player | (player, (suit, value)) <- trick, suit == trumpSuit] > 0
realTrumpSuit = if hasTrumps then trumpSuit else suitLead trick
maxValue = maximum [value | (_, (suit, value)) <- trick, suit == realTrumpSuit]
whoPlayed = head [player | (player, (suit, value)) <- trick, suit == realTrumpSuit, value == maxValue]
-- Exercise 6.59
type Hand = [Card]
northsHand :: Hand
northsHand = [(Spades, Ace), (Spades, Two), (Hearts, King), (Hearts, Seven), (Diamonds, Three)]
-- Exercise 6.60
type Hands = [(Player, Hand)]
allHands :: Hands
allHands = [ (North, [(Spades, Ace), (Spades, Two),
(Hearts, King), (Hearts, Seven),
(Diamonds, Three)]),
(East, [(Spades, Three),
(Hearts, Jack),
(Diamonds, Seven), (Diamonds, Two),
(Clubs, Nine)]),
(South, [(Spades, King), (Spades, Queen), (Spades, Jack),
(Hearts, Two),
(Clubs, Ace)]),
(West, [(Spades, Six),
(Diamonds, Nine), (Diamonds, Five),
(Clubs, King), (Clubs, Eight)])
]
-- Exercise 6.61
-- The following are possible tricks coming from allHands above
trick1, trick2 :: Trick
trick1 = [(North, (Spades, Ace)),
(East, (Spades, Three)),
(South, (Spades, Jack)),
(West, (Spades, Six))
]
trick2 = [(East, (Clubs, Nine)),
(South, (Clubs, Ace)),
(West, (Clubs, Eight)),
(North, (Diamonds, Three)) -- Not holding clubs so it's OK.
]
-- The following are invalid tricks
-- Not possible
trick3 = [(North, (Clubs, Seven)), -- North doesn't have 7 of Clubs
(East, (Spades, Ten)),
(South, (Hearts, Two)),
(West, (Clubs, Nine))
]
-- Not legal -
trick4 = [(North, (Spades, Ace)),
(East, (Spades, Three)),
(South, (Spades, Jack)),
(West, (Diamonds, Five)) -- West has a spade so should lead it
]
checkPlayPossible :: Hands -> Trick -> Bool
-- 1st part - is it possible - i.e. is the card the player played in their hand?
checkPlayPossible hands trick = and [ isInHand hands player card | (player, card) <- trick]
isInHand :: Hands -> Player -> Card -> Bool
isInHand hands player card = length (playerHasCard hands player card) > 0
where playerHasCard hands player card = [p | (p, hand) <- hands, c <- hand, p == player, c == card]
-- 2nd part - is it legal - did the player follow suit of lead?
checkPlayLegal :: Hands -> Trick -> Bool
checkPlayLegal hands trick = and [followedSuitIfPossible hands trumpSuit player card | (player, card) <- trick]
where trumpSuit = suitLead trick
followedSuitIfPossible :: Hands -> Suit -> Player -> Card -> Bool
followedSuitIfPossible hands suit player playedCard
| suit == playedSuit = True
| notHolding hands player suit == True = True
| otherwise = False
where playedSuit = fst playedCard
notHolding :: Hands -> Player -> Suit -> Bool
notHolding hands player suit = length [s | (p, hand) <- hands, (s, v) <- hand, p == player, s == suit] == 0
suitLead :: Trick -> Suit
suitLead trick = fst $ snd $ head trick
checkPlay :: Hands -> Trick -> Bool
checkPlay hands trick = checkPlayPossible hands trick && checkPlayLegal hands trick
-- Exercise 6.62
trick5 = [
(East, (Diamonds, Two)),
(South, (Spades, Jack)),
(West, (Spades, Six)),
(North, (Spades, Ace))
]
tricks = [trick1, trick2, trick3, trick4, trick5]
data Team = NorthSouth | EastWest
deriving (Show, Eq)
whichTeam :: Player -> Team
whichTeam North = NorthSouth
whichTeam South = NorthSouth
whichTeam East = EastWest
whichTeam West = EastWest
-- Note: this does *no* checking that the tricks are possible or legal
-- Also note that the number of tricks should be odd - e.g. 13 in Bridge.
winnerNT :: [Trick] -> (Team, Int)
winnerNT tricks
| northSouthTricks > eastWestTricks = (NorthSouth, northSouthTricks)
| otherwise = (EastWest, eastWestTricks)
where winningTeams = [whichTeam $ winNT trick | trick <- tricks]
northSouthTricks = length [team | team <- winningTeams, team == NorthSouth]
eastWestTricks = length [team | team <- winningTeams, team == EastWest]
-- This is the same function with a suit specified
winnerT :: Suit -> [Trick] -> (Team, Int)
winnerT suit tricks
| northSouthTricks > eastWestTricks = (NorthSouth, northSouthTricks)
| otherwise = (EastWest, eastWestTricks)
where winningTeams = [whichTeam $ winT suit trick | trick <- tricks]
northSouthTricks = length [team | team <- winningTeams, team == NorthSouth]
eastWestTricks = length [team | team <- winningTeams, team == EastWest]
-- Exercise 6.63
-- Call it something different from 'checkPlay' above.
-- Also, the book definition is missing the initial set of hands.
checkPlays :: Hands -> [Trick] -> Bool
-- Can recursively do this. After each trick played, the trick cards are removed from the
-- "hands" and the next trick is used.
checkPlays hands tricks
| hands == [] = True
| tricks == [] = True
| otherwise = checkPlay hands currentTrick &&
checkPlays (removeCardsFromHands hands currentTrick) (tail tricks)
where currentTrick = head tricks
removeCardsFromHands :: Hands -> Trick -> Hands
removeCardsFromHands hands trick = [(player, removeCardFromHand hand card) |
(player, hand) <- hands, (player2, card) <- trick, player == player2]
removeCardFromHand :: Hand -> Card -> Hand
removeCardFromHand hand card = [c | c <- hand, c /= card]
-- Test hands and tricks
-- This is the 1st hand that appears in Andrew Robson's book on bridge.
testHands :: Hands
testHands = [ (North, [
(Spades, Four), (Spades, Two),
(Hearts, Ace), (Hearts, Queen), (Hearts, Seven), (Hearts, Four),
(Diamonds, Ace), (Diamonds, Seven), (Diamonds, Five), (Diamonds, Three), (Diamonds, Two),
(Clubs, Six), (Clubs, Three)
]),
(East, [
(Spades, Five), (Spades, Three),
(Hearts, Eight), (Hearts, Six), (Hearts, Five),
(Diamonds, King), (Diamonds, Queen), (Diamonds, Ten),
(Clubs, Queen), (Clubs, Jack), (Clubs, Five), (Clubs, Four), (Clubs, Two)
]),
(South, [
(Spades, Ace), (Spades, King), (Spades, Ten), (Spades, Nine), (Spades, Seven),
(Hearts, King), (Hearts, Jack), (Hearts, Ten), (Hearts, Nine),
(Diamonds, Six),
(Clubs, Ten), (Clubs, Eight), (Clubs, Seven)
]),
(West, [
(Spades, Queen), (Spades, Jack), (Spades, Eight), (Spades, Six),
(Hearts, Three), (Hearts, Two),
(Diamonds, Jack), (Diamonds, Nine), (Diamonds, Eight), (Diamonds, Four),
(Clubs, Ace), (Clubs, King), (Clubs, Nine)
])
]
-- These are the actual tricks played in the game = 4♥ by South
testTricks = [
-- E/W
[(West, (Clubs, Ace)), (North, (Clubs, Six)), (East, (Clubs, Two)), (South, (Clubs, Eight))],
[(West, (Clubs, King)), (North, (Clubs, Three)), (East, (Clubs, Four)), (South, (Clubs, Ten))],
-- N/S
[(West, (Diamonds, Four)), (North, (Diamonds, Ace)), (East, (Diamonds, Ten)), (South, (Diamonds, Six))],
[(North, (Spades, Two)), (East, (Spades, Five)), (South, (Spades, Ace)), (West, (Spades, Six))],
[(South, (Spades, King)), (West, (Spades, Eight)), (North, (Spades, Four)), (East, (Spades, Three))],
[(South, (Spades, Seven)), (West, (Spades, Queen)), (North, (Hearts, Queen)), (East, (Clubs, Five))],
[(North, (Hearts, Four)), (East, (Hearts, Eight)), (South, (Hearts, Nine)), (West, (Hearts, Two))],
[(South, (Spades, Nine)), (West, (Spades, Jack)), (North, (Hearts, Ace)), (East, (Clubs, Jack))],
[(North, (Hearts, Seven)), (East, (Hearts, Six)), (South, (Hearts, Ten)), (West, (Hearts, Three))],
[(South, (Hearts, Jack)), (West, (Diamonds, Nine)), (North, (Diamonds, Two)), (East, (Hearts, Five))],
[(South, (Spades, Ten)), (West, (Diamonds, Eight)), (North, (Diamonds, Three)), (East, (Diamonds, Queen))],
[(South, (Hearts, King)), (West, (Diamonds, Jack)), (North, (Diamonds, Five)), (East, (Diamonds, King))],
-- E/W
[(South, (Clubs, Seven)), (West, (Clubs, Nine)), (North, (Diamonds, Seven)), (East, (Clubs, Queen))]
]
-- Really need to have a checkPlay that takes a suit
-- checkSuitPlay :: Hands -> [Tricks] -> Bool