-
Notifications
You must be signed in to change notification settings - Fork 15
/
ex3.hs
201 lines (165 loc) · 4.2 KB
/
ex3.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
import Data.Char
import Data.List
import System.IO
size :: Int
size = 3
type Grid = [[Player]]
data Player
= O
| B
| X
deriving (Eq, Ord, Show)
next :: Player -> Player
next O = X
next B = B
next X = O
empty :: Grid
empty = replicate size (replicate size B)
full :: Grid -> Bool
full = notElem B . concat
turn :: Grid -> Player
turn g =
if os <= xs
then O
else X
where
os = length (filter (== O) ps)
xs = length (filter (== X) ps)
ps = concat g
wins :: Player -> Grid -> Bool
wins p g = any line (rows ++ cols ++ dias)
where
line = all (== p)
rows = g
cols = transpose g
dias = [diag g, diag (map reverse g)]
diag :: Grid -> [Player]
diag g = [g !! n !! n | n <- [0 .. size - 1]]
won :: Grid -> Bool
won g = wins O g || wins X g
putGrid :: Grid -> IO ()
putGrid = putStrLn . unlines . concat . interleave bar . map showRow
where
bar = [replicate ((size * 4) - 1) '-']
showRow :: [Player] -> [String]
showRow = beside . interleave bar . map showPlayer
where
beside = foldr1 (zipWith (++))
bar = replicate 3 "|"
showPlayer :: Player -> [String]
showPlayer O = [" ", " O ", " "]
showPlayer B = [" ", " ", " "]
showPlayer X = [" ", " X ", " "]
interleave :: a -> [a] -> [a]
interleave x [] = []
interleave x [y] = [y]
interleave x (y:ys) = y : x : interleave x ys
valid :: Grid -> Int -> Bool
valid g i = 0 <= i && i < size ^ 2 && concat g !! i == B
move :: Grid -> Int -> Player -> [Grid]
move g i p =
if valid g i
then [chop size (xs ++ [p] ++ ys)]
else []
where
(xs, B:ys) = splitAt i (concat g)
chop :: Int -> [a] -> [[a]]
chop n [] = []
chop n xs = take n xs : chop n (drop n xs)
getNat :: String -> IO Int
getNat prompt = do
putStr prompt
xs <- getLine
if xs /= [] && all isDigit xs
then return (read xs)
else do
putStrLn "ERROR: Invalid number"
getNat prompt
tictactoe :: IO ()
tictactoe = run empty O
run :: Grid -> Player -> IO ()
run g p = do
cls
goto (1, 1)
putGrid g
run' g p
cls :: IO ()
cls = putStr "\ESC[2J"
type Pos = (Int, Int)
goto :: Pos -> IO ()
goto (x, y) = putStr ("\ESC[" ++ show y ++ ";" ++ show x ++ "H")
run' :: Grid -> Player -> IO ()
run' g p
| wins O g = putStrLn "Player O wins!\n"
| wins X g = putStrLn "Player X wins!\n"
| full g = putStrLn "It's a draw!\n"
| otherwise = do
i <- getNat (prompt p)
case move g i p of
[] -> do
putStrLn "ERROR: Invalid move"
run' g p
[g'] -> run g' (next p)
prompt :: Player -> String
prompt p = "Player " ++ show p ++ ", enter your move: "
data Tree a =
Node a [Tree a]
deriving (Show)
gametree :: Grid -> Player -> Tree Grid
gametree g p = Node g [gametree g' (next p) | g' <- moves g p]
moves :: Grid -> Player -> [Grid]
moves g p
| won g = []
| full g = []
| otherwise = concat [move g i p | i <- [0 .. ((size ^ 2) - 1)]]
prune :: Int -> Tree a -> Tree a
prune 0 (Node x _) = Node x []
prune n (Node x ts) = Node x [prune (n - 1) t | t <- ts]
depth :: Int
depth = 9
minimax :: Tree Grid -> Tree (Grid, Player)
minimax (Node g [])
| wins O g = Node (g, O) []
| wins X g = Node (g, X) []
| otherwise = Node (g, B) []
minimax (Node g ts)
| turn g == O = Node (g, minimum ps) ts'
| turn g == X = Node (g, maximum ps) ts'
where
ts' = map minimax ts
ps = [p | Node (_, p) _ <- ts']
-- ex3 starts
bestmove :: Grid -> Player -> Grid
bestmove g p = head [g' | Node (g', p') _ <- sortOn maxdepth ts, p' == best]
where
tree = prune depth (gametree g p)
Node (_, best) ts = minimax tree
maxdepth :: Tree a -> Int
maxdepth (Node _ []) = 0
maxdepth (Node _ ts) = 1 + maximum (map maxdepth ts)
-- ex3 ends
main :: IO ()
main = do
hSetBuffering stdout NoBuffering
play empty O
play :: Grid -> Player -> IO ()
play g p = do
cls
goto (1, 1)
putGrid g
play' g p
play' :: Grid -> Player -> IO ()
play' g p
| wins O g = putStrLn "Player O wins!\n"
| wins X g = putStrLn "Player X wins!\n"
| full g = putStrLn "It's a draw!\n"
| p == O = do
i <- getNat (prompt p)
case move g i p of
[] -> do
putStrLn "ERROR: Invalid move"
play' g p
[g'] -> play g' (next p)
| p == X = do
putStr "Player X is thinking... "
(play $! bestmove g p) (next p)