- html - 出于某种原因,IE8 对我的 Sass 文件中继承的 html5 CSS 不友好?
- JMeter 在响应断言中使用 span 标签的问题
- html - 在 :hover and :active? 上具有不同效果的 CSS 动画
- html - 相对于居中的 html 内容固定的 CSS 重复背景?
我在 MancalaBoard.hs 中有一个函数,如下所示:
allowedMoves :: MancalaBoard -> Player -> [Int]
allowedMoves board p
| (p == PlayerA && getCurPlayer board == p) = findIndices (>0) (init(take (length (playerSide board PlayerA)+1) (getBoardData board)))
| (p == PlayerB && getCurPlayer board == p) = map (+(length (playerSide board PlayerA))) (findIndices (>0) (init(drop (length (playerSide board PlayerA)) (getBoardData board))))
| otherwise = []
作为引用,MancalaBoard 是这样的:
data MancalaBoard = MancalaBoardImpl [Int] Player
当我运行 MancalaBoard.hs 时,我可以执行以下操作:
*MancalaBoard> let board = [5,0,2,7,0,1,5,6,1,7,7,5,0,2] :: [Int]
*MancalaBoard> let mboard = MancalaBoardImpl board PlayerB
*MancalaBoard> move mboard 7
Player A: [5,0,2,7,0,1,5]
Player B: [0,2,8,8,6,1,3]
Current turn: PlayerB
但我有另一个名为 TwoPlayerMancala.hs 的文件,它导入 MancalaBoard。当我尝试在此文件中执行相同的移动时,出现错误:
Player A: [5,0,2,7,0,1,5]
Player B: [6,1,7,7,5,0,2]
Current turn: PlayerB
Player B, please make your move
7
*** Exception: Not an allowed move
知道为什么会发生这种情况吗?这是两个文件的完整副本,以防有帮助:
module MancalaBoard (MancalaBoard, Player, initial, getCurPlayer,
getBoardData, numCaptured, move, allowedMoves, isAllowedMove,
gameOver, winners) where
import Data.List as List -- for List.elemIndex
import Data.Maybe as Maybe -- for List.elemIndex
{-
- The stones on a Mancala board are simply recorded as a list of Ints. The
- Ints come in the following order:
- 1. The boardSize pits belonging to PlayerA
- 2. The store belonging to PlayerA
- 3. The boardSize pits belonging to PlayerB
- 4. The store belonging to PlayerB
-}
data MancalaBoard = MancalaBoardImpl [Int] Player
data Player = PlayerA | PlayerB deriving (Eq, Show)
---- Functions/constants for Player ----
allPlayers = [PlayerA, PlayerB]
numPlayers = length allPlayers
playerNum :: Player -> Int
playerNum p = fromJust $ List.elemIndex p allPlayers
playerWithNum :: Int -> Player
playerWithNum i = allPlayers !! i
nextPlayer :: Player -> Player
{- Find the player whose turn is next -}
nextPlayer p = playerWithNum $ ((playerNum p) + 1) `mod` numPlayers
---- Functions/constants for MancalaBoard ----
{- number of pits on each side -}
boardSize = 6
{- number of stones in each pit -}
startStones = 4
{- the initial mancala board -}
initial :: MancalaBoard
initial = MancalaBoardImpl (concat $ take numPlayers (repeat boardSide)) PlayerA
-- One side of board pit at end
where boardSide = take boardSize (repeat startStones) ++ [0]
{- return the index of the first pit belonging to a player -}
indexForFirstPit :: Player -> Int
indexForFirstPit p = (playerNum p) * (boardSize + 1)
{- return the index of the store for that player -}
indexForPlayerStore :: Player -> Int
indexForPlayerStore p = boardSize + (indexForFirstPit p)
{- return the indices for the pits (without the store) for a player -}
indicesForPlayerSide :: Player -> [Int]
indicesForPlayerSide p = [firstPit .. lastPit] where
firstPit = indexForFirstPit p
lastPit = firstPit + boardSize - 1
---- Retrieve information about Mancala Board
{- return the player who has the current turn -}
getCurPlayer :: MancalaBoard -> Player
getCurPlayer (MancalaBoardImpl xs player) = player
{- return the list of all pits in the board -}
getBoardData :: MancalaBoard -> [Int]
getBoardData (MancalaBoardImpl xs player) = xs
{- return the side of the board for a specified player, including the store at
- the end -}
playerSide :: MancalaBoard -> Player -> [Int]
playerSide (MancalaBoardImpl xs player) p
| (p == PlayerA) = take (length xs `div` 2) xs
| (p == PlayerB) = drop (length xs `div` 2) xs
{- return the number of captured pieces in specified player's store -}
numCaptured :: MancalaBoard -> Player -> Int
numCaptured board p = last $ playerSide board p
{- allowedMoves returns a list of valid moves for the current player:
- ie. the indices of pits which belong to that player, and which contain one
- or more pieces -}
allowedMoves :: MancalaBoard -> Player -> [Int]
allowedMoves board p
| (p == PlayerA && getCurPlayer board == p) = findIndices (>0) (init(take (length (playerSide board PlayerA)+1) (getBoardData board)))
| (p == PlayerB && getCurPlayer board == p) = map (+(length (playerSide board PlayerA))) (findIndices (>0) (init(drop (length (playerSide board PlayerA)) (getBoardData board))))
| otherwise = []
{- check that a move is valid for the current player -}
isAllowedMove :: MancalaBoard -> Int -> Bool
isAllowedMove board q = q `elem` allowedMoves board (getCurPlayer board)
{- We number the pits from 0 to 13 (2 players, 6 pits each and 1 store each)
- This function takes a board and applies the move where the player selects
- the numbered pit, giving back an updated board after the move -}
move :: MancalaBoard -> Int -> MancalaBoard
move (MancalaBoardImpl xs PlayerA) n
| ((isAllowedMove (MancalaBoardImpl xs PlayerA) n) == True) = (MancalaBoardImpl intmap (choose PlayerA))
| otherwise = error "Not an allowed move" where
q = xs !! n
plusoned = map (+1) (take q (drop (n+1) xs))
intmap = (take n xs) ++ [0] ++ plusoned ++ drop (n+1+q) xs
choose plyr
| (n + q == 6) = PlayerA
| otherwise = PlayerB
move (MancalaBoardImpl xs PlayerB) n
| ((isAllowedMove (MancalaBoardImpl xs PlayerB) n) == True) = (MancalaBoardImpl reswapsides (choose PlayerB))
| otherwise = error "Not an allowed move" where
swapsides = drop (length xs `div` 2) xs ++ take (length xs `div` 2) xs
performmove = getBoardData $ move (MancalaBoardImpl swapsides PlayerA) (n - (length xs `div` 2))
reswapsides = drop (length xs `div` 2) performmove ++ take (length xs `div` 2) performmove
choose plyr
| (n + (xs !! n) == 13) = PlayerB
| otherwise = PlayerA
{- gameOver checks to see if the game is over (i.e. if one player's side of the
- board is all empty -}
gameOver :: MancalaBoard -> Bool
gameOver board = (all (==0) (init (playerSide board PlayerA))) || (all (==0) (init (playerSide board PlayerB)))
{- winner returns a list of players who have the top score: there will only be
- one in the list if there is a clear winner, and none if it is a draw -}
winners :: MancalaBoard -> [Player]
winners board = filter g allPlayers
where g plyr
| (sum(playerSide board plyr) == maximum (mapsum board)) = True
| otherwise = False
mapsum board = map f allPlayers
f plyr = sum (playerSide board plyr)
---- show
instance Show MancalaBoard where
show (MancalaBoardImpl boardData player) =
-- (show boardData) ++ " " ++ (show player)
"Player A: " ++ (show (take ((length boardData) `div` 2) boardData)) ++ "\n" ++
"Player B: " ++ (show (drop ((length boardData) `div` 2) boardData)) ++ "\n" ++
"Current turn: " ++ (show player)
---- tests
testboard1 = MancalaBoardImpl [4,4,4,4,4,4,0,4,4,4,4,4,4,0] PlayerA
testboard2 = MancalaBoardImpl [0,1,2,3,4,5,6,5,5,5,5,0,0,7] PlayerB
testboard3 = MancalaBoardImpl [1,1,1,1,1,1,18,2,2,2,2,2,2,12] PlayerA
testboard4 = MancalaBoardImpl [0,1,0,2,0,3,6,5,0,10,0,15,0,21] PlayerB
testGetCurPlayer = (getCurPlayer testboard1 == PlayerA)
testGetBoardData = (getBoardData testboard2 == [0,1,2,3,4,5,6,5,5,5,5,0,0,7])
testPlayerSide = (playerSide testboard3 PlayerA == [1,1,1,1,1,1,18])
testNumCaptured = (numCaptured testboard4 PlayerB == 21)
testAllowedMoves = (allowedMoves testboard1 PlayerA == [0,1,2,3,4,5])
testIsAllowedMove = (isAllowedMove testboard2 0 == False)
testMove = (getCurPlayer(move testboard4 9) == PlayerA) && (getBoardData(move testboard4 9) == [1,2,1,3,1,4,6,5,0,0,1,16,1,22])
testGameOver = (gameOver testboard3 == False)
testWinners = (winners testboard1 == [PlayerA,PlayerB])
和
-- TwoPlayerMancala.hs
import MancalaBoard
main :: IO ()
main = do
putStrLn "Welcome! This program allows two people to play Mancala with each other."
putStrLn "For Player A, their pits are numbered 0, 1, 2, 3, 4, and 5. 6 is their store."
putStrLn "For Player B, their pits are numbered 7, 8, 9, 10, 11, and 12. 13 is their store."
putStrLn "In other words, this program represents a board that looks like this:"
putStrLn "[ ] [ 0] [ 1] [ 2] [ 3] [ 4] [ 5] [ 6]"
putStrLn "[13] [12] [11] [10] [ 9] [ 8] [ 7] [ ]"
putStrLn "Balls travel counterclockwise on this board."
putStrLn "To quit, enter \"quit\" at any point"
putStrLn "The game begins now."
playGame
playGame :: IO ()
playGame = do
putStrLn $ show initial
n <- getLine
let num = read n :: Int
makeMove initial num
makeMove board n = do
let board1 = move board n
putStrLn $ show board1
if (gameOver board1)
then endGame board1
else return ()
if (show (getCurPlayer board1) == "PlayerA") then putStrLn "Player A, please make your move"
else putStrLn "Player B, please make your move"
m <- getLine
if (m == "quit")
then endGame board1
else return ()
let mum = read m :: Int
makeMove board1 mum
endGame :: MancalaBoard -> IO ()
endGame board = do
putStrLn "The game is over! Here is the final board: "
putStrLn $ show board
putStrLn "The winner is: "
putStrLn $ show (winners board)
return ()
{-if ((winners board) == [PlayerA])
then let winner = "Player A" else
if ((winners board) == [PlayerB])
then let winner = "Player B" else
let winner = ""
putStrLn "The game is over! Here is the final board:"
putStrLn $ show board
if (winner == ("Player A" || "Player B"))
then putStrLn "The winner is " ++ winner
else putStrLn "The game was a tie!"-}
* 编辑 *这是导致错误的完整输入和输出:
*Main> main
Welcome! This program allows two people to play Mancala with each other.
For Player A, their pits are numbered 0, 1, 2, 3, 4, and 5. 6 is their store.
For Player B, their pits are numbered 7, 8, 9, 10, 11, and 12. 13 is their store.
In other words, this program represents a board that looks like this:
[ ] [ 0] [ 1] [ 2] [ 3] [ 4] [ 5] [ 6]
[13] [12] [11] [10] [ 9] [ 8] [ 7] [ ]
Balls travel counterclockwise on this board.
To quit, enter "quit" at any point
The game begins now.
Player A: [4,4,4,4,4,4,0]
Player B: [4,4,4,4,4,4,0]
Current turn: PlayerA
2
Player A: [4,4,0,5,5,5,1]
Player B: [4,4,4,4,4,4,0]
Current turn: PlayerA
Player A, please make your move
5
Player A: [4,4,0,5,5,0,2]
Player B: [5,5,5,5,4,4,0]
Current turn: PlayerB
Player B, please make your move
8
Player A: [4,4,0,5,5,0,2]
Player B: [5,0,6,6,5,5,1]
Current turn: PlayerB
Player B, please make your move
12
Player A: [5,5,1,6,5,0,2]
Player B: [5,0,6,6,5,0,2]
Current turn: PlayerA
Player A, please make your move
1
Player A: [5,0,2,7,6,1,3]
Player B: [5,0,6,6,5,0,2]
Current turn: PlayerA
Player A, please make your move
5
Player A: [5,0,2,7,6,0,4]
Player B: [5,0,6,6,5,0,2]
Current turn: PlayerA
Player A, please make your move
4
Player A: [5,0,2,7,0,1,5]
Player B: [6,1,7,7,5,0,2]
Current turn: PlayerB
Player B, please make your move
7
*** Exception: Not an allowed move
最佳答案
当我用第一个示例中的板替换 initial
时,我可以很好地执行“7”:
-- in MancalaBoard.hs
initial = MancalaBoardImpl [5,0,2,7,0,1,5,6,1,7,7,5,0,2] PlayerB
-- ghci TwoPlayerMancala.hs; main
...
The game begins now.
Player A: [5,0,2,7,0,1,5]
Player B: [6,1,7,7,5,0,2]
Current turn: PlayerB
7
Player A: [5,0,2,7,0,1,5]
Player B: [0,2,8,8,6,1,3]
Current turn: PlayerB
Player B, please make your move
换句话说,我无法重复该错误?
(这是一条注释,直到我想粘贴确切的输出为止。顺便说一句,您也应该这样做。)
关于haskell - 导入的函数似乎与原始实现的运行方式不同,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/20206101/
背景: 我最近一直在使用 JPA,我为相当大的关系数据库项目生成持久层的轻松程度给我留下了深刻的印象。 我们公司使用大量非 SQL 数据库,特别是面向列的数据库。我对可能对这些数据库使用 JPA 有一
我已经在我的 maven pom 中添加了这些构建配置,因为我希望将 Apache Solr 依赖项与 Jar 捆绑在一起。否则我得到了 SolarServerException: ClassNotF
interface ITurtle { void Fight(); void EatPizza(); } interface ILeonardo : ITurtle {
我希望可用于 Java 的对象/关系映射 (ORM) 工具之一能够满足这些要求: 使用 JPA 或 native SQL 查询获取大量行并将其作为实体对象返回。 允许在行(实体)中进行迭代,并在对当前
好像没有,因为我有实现From for 的代码, 我可以转换 A到 B与 .into() , 但同样的事情不适用于 Vec .into()一个Vec . 要么我搞砸了阻止实现派生的事情,要么这不应该发
在 C# 中,如果 A 实现 IX 并且 B 继承自 A ,是否必然遵循 B 实现 IX?如果是,是因为 LSP 吗?之间有什么区别吗: 1. Interface IX; Class A : IX;
就目前而言,这个问题不适合我们的问答形式。我们希望答案得到事实、引用资料或专业知识的支持,但这个问题可能会引发辩论、争论、投票或扩展讨论。如果您觉得这个问题可以改进并可能重新打开,visit the
我正在阅读标准haskell库的(^)的实现代码: (^) :: (Num a, Integral b) => a -> b -> a x0 ^ y0 | y0 a -> b ->a expo x0
我将把国际象棋游戏表示为 C++ 结构。我认为,最好的选择是树结构(因为在每个深度我们都有几个可能的移动)。 这是一个好的方法吗? struct TreeElement{ SomeMoveType
我正在为用户名数据库实现字符串匹配算法。我的方法采用现有的用户名数据库和用户想要的新用户名,然后检查用户名是否已被占用。如果采用该方法,则该方法应该返回带有数据库中未采用的数字的用户名。 例子: “贾
我正在尝试实现 Breadth-first search algorithm , 为了找到两个顶点之间的最短距离。我开发了一个 Queue 对象来保存和检索对象,并且我有一个二维数组来保存两个给定顶点
我目前正在 ika 中开发我的 Python 游戏,它使用 python 2.5 我决定为 AI 使用 A* 寻路。然而,我发现它对我的需要来说太慢了(3-4 个敌人可能会落后于游戏,但我想供应 4-
我正在寻找 Kademlia 的开源实现C/C++ 中的分布式哈希表。它必须是轻量级和跨平台的(win/linux/mac)。 它必须能够将信息发布到 DHT 并检索它。 最佳答案 OpenDHT是
我在一本书中读到这一行:-“当我们要求 C++ 实现运行程序时,它会通过调用此函数来实现。” 而且我想知道“C++ 实现”是什么意思或具体是什么。帮忙!? 最佳答案 “C++ 实现”是指编译器加上链接
我正在尝试使用分支定界的 C++ 实现这个背包问题。此网站上有一个 Java 版本:Implementing branch and bound for knapsack 我试图让我的 C++ 版本打印
在很多情况下,我需要在 C# 中访问合适的哈希算法,从重写 GetHashCode 到对数据执行快速比较/查找。 我发现 FNV 哈希是一种非常简单/好/快速的哈希算法。但是,我从未见过 C# 实现的
目录 LRU缓存替换策略 核心思想 不适用场景 算法基本实现 算法优化
1. 绪论 在前面文章中提到 空间直角坐标系相互转换 ,测绘坐标转换时,一般涉及到的情况是:两个直角坐标系的小角度转换。这个就是我们经常在测绘数据处理中,WGS-84坐标系、54北京坐标系
在软件开发过程中,有时候我们需要定时地检查数据库中的数据,并在发现新增数据时触发一个动作。为了实现这个需求,我们在 .Net 7 下进行一次简单的演示. PeriodicTimer .
二分查找 二分查找算法,说白了就是在有序的数组里面给予一个存在数组里面的值key,然后将其先和数组中间的比较,如果key大于中间值,进行下一次mid后面的比较,直到找到相等的,就可以得到它的位置。
我是一名优秀的程序员,十分优秀!