So I was reading the book Programming in Haskell by Graham Hutton. In chapter 11, the game tic-tac-toe is implemented. My question is about the AI part of the game, where minimax is used. I was a little bit confused about the prune function: