diff --git a/GUI.hs b/GUI.hs new file mode 100644 --- /dev/null +++ b/GUI.hs @@ -0,0 +1,614 @@ +{- + Graphical user interface module for Lost Cities game + Pedro Vasconcelos , 2009 + + Original card game designed by Reiner Knizia +-} +module GUI where +import Graphics.UI.WX hiding (play, when, Color) +import qualified Graphics.UI.WX (Color) +import Graphics.UI.WXCore hiding (when, Color) + +import Control.Monad +import Data.Map (Map, (!)) +import qualified Data.Map as Map +import LostCities +import Utils +import List +import Text.Printf + + +------------------------------------------------------------- +-- setup the GUI +-- toplevel function +------------------------------------------------------------- +gui = do sf <- statusField [text := "Welcome to Lost Cities"] + top <- frame [text := "Lost Cities", statusBar := [sf]] + + p1 <- panel top [] + exps1<- sequence [newExpedition p1 [owner := Computer] | c<-colors] + exps2<- sequence [newExpedition p1 [owner := Human] | c<-colors] + discards <- sequence [newDiscard p1 [] | c<-colors] + deck <- newDeck p1 [enabled := False] + + p2 <- panel top [] + hand <- newHand p2 [] + b1 <- button p2 [text := "Play"] + b2 <- button p2 [text := "Discard"] + + -- initial game position + game <- newGame "Human" "Computer" + vgame <- varCreate game + + -- display info message + let display msg = set sf [text := msg] + + -- perform some gameplay action + let withPlay action cont + = do g <- varGet vgame + case runPlay action g of + Left msg -> display msg + Right (_,g') -> do display "" + varSet vgame g' + cont g' + + -- GUI update code + let updateDeck g + = set deck [decksize := length (drawPile g)] + + let updateHand p + = set hand [cards := sort (playerHand p)] + + let updateExpeditions exps p + = sequence_ [ set w [cards := reverse cs] + | (w,cs)<-zip exps (expeditionCards p)] + + let updateDiscards g + = sequence_ [ set x [cards := [(c,v)|v<-vs]] + | (x,c,vs) <- zip3 discards colors (Map.elems (discard g))] + + let updateCtls g + = do set b1 [enabled := (r==0)] + set b2 [enabled := (r==0)] + sequence_ [set d [enabled := (r==1)] | d<-discards] + set deck [enabled := (r==1)] + set hand [enabled := (r==0)] + where r = turn g `rem` 4 -- turn count remainer + + + + ------------------------------------------- + -- event handlers for buttons + ------------------------------------------- + set b1 [on command := + withSelection hand + (\i -> do cs<-get hand cards + withPlay (playAction1 (Play (cs!!i))) + (\g -> do updateHand (active g) + updateExpeditions exps2 (active g) + updateCtls g + ) + )] + + + set b2 [on command := + withSelection hand + (\i -> do cs<-get hand cards + withPlay (playAction1 (Discard (cs!!i))) + (\g -> do updateHand (active g) + updateDiscards g + updateCtls g)) + ] + + -- click button handler for draw deck and discard piles + set deck [clickAction := + withPlay (playAction2 DrawFromDeck >> + switchPlayer) + (\g -> do updateHand (other g) + updateDeck g + updateCtls g + display "Computer thinking..." + )] + + + sequence_ [set d [clickAction := + withPlay (playAction2 (DrawFromDiscard c) >> + switchPlayer) + (\g -> do updateHand (other g) + updateDiscards g + updateCtls g + display "Computer thinking..." + ) + ] + | (c,d) <- zip colors discards] + + + ------------------------------------- + -- timer event to play the computer + ------------------------------------- + t <- timer top + [interval := 1000, + on command := + do { g <- varGet vgame + ; if endGame g then + do { let txt = showScore g + ; display txt + ; infoDialog top "Game end" txt + ; close top + } + else when (playing (active g) == Computer) $ + do { m <- defaultAI g + ; display ("Computer " ++ showMove m) + ; let g'= runSafePlay' (play m) g + ; updateExpeditions exps1 (other g') + ; updateDiscards g' + ; updateDeck g' + ; updateCtls g' + ; varSet vgame g' + } + }] + + + ------------------------------ + -- set board layout + ------------------------------ + set top [layout := + column 8 + [container p1 $ + grid 0 0 [ glue : map (marginRight.alignBottom.vfill.widget) exps1 ++ + [glue, glue], + glue : map (fill.widget) discards ++ + [marginLeft (widget deck), glue], + glue : map (marginRight.alignTop.vfill.widget) exps2 + ++ [glue]] + , container p2 $ + row 16 [glue, widget hand, + valignCenter (column 8 [widget b1,widget b2]), + glue]]] + + -- + updateDeck game + updateHand (active game) + where + + -- show a move in textual form + showMove (a1,a2) = showAction1 a1 ++ " & " ++ showAction2 a2 + showAction1 (Play (c,v)) = "played " ++ show c ++ " " ++ showFace v + showAction1 (Discard (c,v)) = "discarded " ++ show c ++ " " ++ showFace v + showAction2 DrawFromDeck = "drawn from deck" + showAction2 (DrawFromDiscard c) = "drawn from " ++ show c ++ " discard" + showFace v | v>0 = show v + | otherwise = "multiplier" + + + showScore g + = name p1 ++ ": " ++ show s1 ++ " points, " ++ + name p2 ++ ": " ++ show s2 ++ " points." + where s1 = score p1 + s2 = score p2 + p1 = active g + p2 = other g + + + + +-- set cursor pointer for a window +cursorSet True = cursorHand +cursorSet False = cursorArrow + +cursorHand w = do cursor <- cursorCreateFromStock wxCURSOR_HAND + windowSetCursor w cursor + return () + +cursorArrow w = do cursor <- cursorCreateFromStock wxCURSOR_ARROW + windowSetCursor w cursor + return () + + + + + +----------------------------------------------------------------------------- +-- custom widget classes + +-- widgets with a card list attribute +class Cards w where + cards :: Attr w [Card] + + +-- widgets with a click action attribute +class ClickAction w where + clickAction :: Attr w (IO ()) + + +-- custom widget for a hand of cards +data Hand = Hand { handWindow :: Panel () + , handCards :: Var [Card] + , handSelection :: Var Int + , handDx :: Var Int + , handDy :: Var Int + , handAble :: Var Bool + } + +-- attributes instances +instance Widget Hand where + widget h = widget (handWindow h) + +instance Visible Hand where + -- refresh layout of hand widget + refresh h = do dx <- varGet (handDx h) + dy <- varGet (handDy h) + cs <- get h cards + -- let n = max 0 (length cs - 1) + let n = 7 + let w = handWindow h + set w [layout := space (n*dx+cardWidth) (dy+cardHeight)] + refit w + repaint w + + +instance Able Hand where + enabled = newAttr "enabled" getter setter + where getter = varGet . handAble + setter = varSet . handAble + +instance Selection Hand where + selection = newAttr "selection" getter setter + where getter h = varGet (handSelection h) + setter h sel = do varSet (handSelection h) sel + refresh h + + +-- perform some action with a selection +withSelection :: Selection w => w -> (Int -> IO ()) -> IO () +withSelection w action + = do { i<-get w selection; when (i>=0) $ action i } + + +-- custom attribute: list of cards +instance Cards Hand where + cards = newAttr "cards" getter setter + where getter h = varGet (handCards h) + -- setting cards clears selection + setter h cs = do varSet (handCards h) cs + varSet (handSelection h) (-1) + refresh h + + +newHand :: Window a -> [Prop Hand] -> IO Hand +newHand parent props + = do vcards <- varCreate [] -- empty card list + vsel <- varCreate (-1) -- no selection + vdx <- varCreate (cardWidth`div`2) -- default gaps + vdy <- varCreate (cardHeight`div`6) + vable <- varCreate True + w <- panel parent [] + let h = Hand w vcards vsel vdx vdy vable + set w [on resize := repaint w, + on paint := do_draw h, + on click := do_click h, + on enter := (\_ -> do able<-varGet vable + cursorSet able w) + ] + set h props + refresh h + return h + where + -- draw method + do_draw h dc (Rect x y _ _) + = do dx <- varGet (handDx h) + -- dy <- get h deltaY + dy <- dcGetTextHeight dc + varSet (handDy h) dy + cs <- get h cards + sel<- get h selection + -- draw the list of hand cards + let pts = [pt (x+k*dx) (y+h) | k<-[0..], + let h = if sel==k then 0 else dy] + drawCardlist (zip cs pts) dc + + -- click method + do_click h (Point x y) + = do able <- get h enabled + when able $ + do dx <- varGet (handDx h) + cs <- get h cards + let k = max (-1) $ min (x`div`dx) (length cs - 1) + set h [selection :~ + (\sel -> if sel<0 then k + else if sel==k then (-1) else k)] + refresh h + + + +----------------------------------------------------------------------- +-- custom widget for expeditions +----------------------------------------------------------------------- +data Expedition + = Expedition { expWindow :: Panel () + , expCards :: Var [Card] + , expOwner :: Var Playing -- computer or human + } + + +instance Widget Expedition where + widget xp = widget (expWindow xp) + + +instance Visible Expedition where + -- recompute geometry + refresh exp = repaint w + where w = expWindow exp + + +instance Cards Expedition where + cards = newAttr "cards" getter setter + where getter exp = varGet (expCards exp) + setter exp cs = do varSet (expCards exp) cs + refresh exp + + +owner :: Attr Expedition Playing +owner = newAttr "owner" getter setter + where getter exp = varGet (expOwner exp) + setter exp p = do varSet (expOwner exp) p + refresh exp + + +newExpedition :: Window a -> [Prop Expedition] -> IO Expedition +newExpedition parent props + = do vcs <- varCreate [] + vown <- varCreate Human + w <- panel parent [] + let exp = Expedition w vcs vown + set w [layout := space cardWidth cardHeight, + on resize := repaint w, + on paint := do_draw exp] + set exp props + refresh exp + return exp + where + -- drawing method + -- + do_draw exp dc (Rect x y w h) + = do cs <- get exp cards + own <- get exp owner + -- inquire text height in current DC + dy <- dcGetTextHeight dc + let pts = case own of + Human -> [pt x (k*dy) | k<-[0..]] + Computer -> [pt x (h-cardHeight-k*dy) | k<-[0..]] + drawCardlist (zip cs pts) dc + set (expWindow exp) [tooltip := score_info cs] + + -- scoring info + score_info [] = "" + score_info cs = show score ++ " points" + where score = scoreStack (map snd cs) + + + +------------------------------------------------ +-- custom widget for a discard pile +------------------------------------------------ +data DiscardPile + = DiscardPile { discardWindow :: Panel () + , discardPile :: Var [Card] + , discardAble :: Var Bool + , discardAction :: Var (IO ()) + } + + +instance Widget DiscardPile where + widget d = widget (discardWindow d) + + +instance Visible DiscardPile where + refresh d = repaint (discardWindow d) + +instance Able DiscardPile where + enabled = newAttr "enabled" getter setter + where getter = varGet . discardAble + setter = varSet . discardAble + +instance Cards DiscardPile where + cards = newAttr "cards" getter setter + where getter = varGet . discardPile + setter = varSet . discardPile + + +instance ClickAction DiscardPile where + clickAction = newAttr "clickAction" getter setter + where getter = varGet . discardAction + setter = varSet . discardAction + + +newDiscard :: Window a -> [Prop DiscardPile] -> IO DiscardPile +newDiscard parent props + = do w <- panel parent [] + vpile <- varCreate [] + vable <- varCreate True + vact <- varCreate (return ()) + let d = DiscardPile w vpile vable vact + set w [ on resize := repaint w, + on paint := do_draw d, + on click := (\_ -> do able<-varGet vable + when able $ + do {act<-varGet vact; act}), + on enter := (\_ -> do cs<-varGet vpile + able<-varGet vable + cursorSet (able && not (null cs)) w + ) + ] + set d props + set w [layout := space cardWidth cardHeight] + refresh w + return d + where + do_draw d dc r@(Rect x y _ _) + = do drawRect dc r [brush := brushSolid boardBgcolor, + pen := penTransparent] + cs <- get d cards + -- only draw the top card (list head) + drawCardlist (zip cs [pt x y]) dc + + -- background color (brown) + boardBgcolor = colorRGB 160 82 45 + + +---------------------------------------- +-- custom widget for a deck of cards +---------------------------------------- +data Deck = Deck { deckWindow :: Panel () + , deckSize :: Var Int + , deckAble :: Var Bool + , deckAction :: Var (IO ()) + } + +instance Widget Deck where + widget d = widget (deckWindow d) + + + +-- re-fit deck layout +instance Visible Deck where + refresh d = do n<-varGet (deckSize d) + let k = ceiling (fromIntegral n/10) + let w = deckWindow d + set w [layout := space (cardWidth+2*k) (cardHeight+2*k), + tooltip := show n ++ " cards left"] + refit w + repaint w + + +instance Able Deck where + enabled = newAttr "enabled" getter setter + where getter = varGet . deckAble + setter = varSet . deckAble + + +instance ClickAction Deck where + clickAction = newAttr "clickAction" getter setter + where getter = varGet . deckAction + setter = varSet . deckAction + + +-- custom attribute: size of deck (number of cards to draw) +decksize :: Attr Deck Int +decksize = newAttr "decksize" getter setter + where getter d = varGet (deckSize d) + setter d n = do varSet (deckSize d) n + refresh d + + +newDeck :: Window a -> [Prop Deck] -> IO Deck +newDeck parent props + = do vsize <- varCreate 0 + vable <- varCreate True + vact <- varCreate (return ()) + w <- panel parent [] + let d = Deck w vsize vable vact + set w [on resize := repaint w, + on paint := do_draw d, + on click := (\_ -> do able<-varGet vable + when able $ do {act<-varGet vact; act}), + on enter := (\_ -> do able<-varGet vable + cursorSet able w) + ] + set d props + refresh d + return d + where + -- drawing method + do_draw d dc (Rect x y _ _) + = do n <- get d decksize + let k = ceiling (fromIntegral n/10) + let pts = [pt (x+2*i) (y+2*i) | i<-[0..k-1]] + sequence_ [draw_back dc pt | pt<-pts] + + -- draw a card back + draw_back dc pt + = do roundedRect dc r cardRadius [penColor := grey, + brush := brushSolid grey] + roundedRect dc r cardRadius [penColor := black, + brushColor := black, + brushKind := BrushHatch HatchCrossDiag] + where r = Rect x y cardWidth cardHeight + x = pointX pt + y = pointY pt + + + + + +------------------------------------------------------------------- +-- auxiliary code +------------------------------------------------------------------- + +-- inquire text height in current DC +dcGetTextHeight dc = liftM sizeH $ getTextExtent dc "X" + +-- draw an overlapping list of cards +drawCardlist cardpts dc + = do dcSetBrushStyle dc (brushSolid black) + dcSetFontStyle dc myFont + -- maximum numeral text extent + sz <- getTextExtent dc "99" + sequence_ [drawCard card dc sz pt | (card,pt) <- cardpts] + where + myFont = fontSwiss { _fontSize=10, _fontWeight=WeightBold } + + +-- draw a single card +drawCard card@(c,v) dc sz p + = do roundedRect dc r0 cardRadius [brushColor:=black, penColor:=white] + drawRect dc r1 [brushColor:=wxc, penColor:=wxc] + sequence_ [drawText dc txt p [textColor:= wxc] + | p <- pts] + where r0 = Rect x y cardWidth cardHeight + r1 = Rect (x+2) (y+h) (cardWidth-4) (cardHeight-2*h) + pts = [pt (x+2) (y+1), pt (x+cardWidth-w-2) (y+1), pt (x+2) + (y+cardHeight-h), pt (x+cardWidth-w-2) (y+cardHeight-h)] + w = sizeW sz + h = sizeW sz + x = pointX p + y = pointY p + txt = showFace v + wxc = wxColor c + + +-- convert card color to wxWidgets color +wxColor :: Color -> Graphics.UI.WX.Color +wxColor White = white +wxColor Yellow = yellow +wxColor Red = red +wxColor Green = green +wxColor Blue = cyan + + + +-- convert a card face value to a string +showFace :: Int -> String +showFace n | n==0 = " \x2718" -- multiplication sign + | otherwise = printf "%2d" n + +{- + Alternative symbols for investment cards: + check marks: U+2713, U+2714 + multiplication sign: U+2715, U+2716 + ballot marks: U+2717, U+2718 + signing hands: U+F02D U+270D U+E41E U+E01B +-} + +cardWidth, cardHeight :: Int +cardWidth = 60 +cardHeight = 90 + +cardRadius :: Double +cardRadius = 5 + + + + + + diff --git a/LICENSE b/LICENSE new file mode 100644 --- /dev/null +++ b/LICENSE @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/LostCities.hs b/LostCities.hs new file mode 100644 --- /dev/null +++ b/LostCities.hs @@ -0,0 +1,434 @@ +{- + Game representation and AI player for Lost Cities game + Pedro Vasconcelos , 2009 +-} +module LostCities where +import Prelude hiding (round) +import List +import Maybe +import Data.Map (Map, (!)) +import qualified Data.Map as Map +import Control.Monad +import Control.Monad.Error +import Control.Monad.State +import Minimax +import Data.Tree +import Utils + +-- expedition colors +data Color = Red | Green | White | Blue | Yellow + deriving (Eq,Ord,Show,Read,Enum,Bounded) + +-- card face values: 0=investment; 2..10=value +type Face = Int + +-- a card with a color and face +type Card = (Color,Face) + +-- a stack cards (of the same color) +type Stack = [Face] + +-- projection functions +color :: Card -> Color +color = fst + +face :: Card -> Face +face = snd + + +-- the full playing deck +fullDeck :: [Card] +fullDeck = [(c,f) | c<-colors, f<-faces] + +-- all color +colors :: [Color] +colors = [minBound .. maxBound] + +-- all faces, including repeated investment cards +faces :: [Face] +faces = 0:0:0:[2..10] + +data Playing = Human | Computer deriving (Eq,Read,Show) + +-- data relative to one player +-- separate the cards in hand into two parts +-- hidden: cards drawn from deck (unknown to opponent) +-- shown: cards drawn from discard (known to opponent) +data Player + = Player { name :: String + , playing :: Playing -- human or computer + , hidden :: [Card] -- cards hidden in player's hand + , shown :: [Card] -- cards the opponent knows about + , expeditions :: Map Color Stack -- player's expeditions + , accumulated :: Int -- score from previous rounds + } + deriving (Eq,Read,Show) + + +-- collect all player' hand cards +-- not necessarily in order +playerHand :: Player -> [Card] +playerHand p = shown p ++ hidden p + +-- collect all player's expedition cards +expeditionCards :: Player -> [[Card]] +expeditionCards p = [[(c,v)|v<-vs] | (c,vs)<-Map.assocs (expeditions p)] + +-- add a card from discard pile to a player +addShown :: Player -> Card -> Player +addShown p c = p { shown=c:shown p } + +-- add a card drawn from deck to a player +addHidden :: Player -> Card -> Player +addHidden p c = p { hidden=c:hidden p } + + +-- withdraw a card from player's hand +-- tricky: removes from known cards if it occurs there +withdraw :: Player -> Card -> Player +withdraw p c | c`elem`shown p = p { shown=delete c (shown p) } + | otherwise = p { hidden=delete c (hidden p) } + + + +-- a game move, split into first and second parts +type Move = (Action1,Action2) + +-- first part action +data Action1 = Play Card + | Discard Card + deriving (Eq,Ord,Show,Read) + +-- second part action +data Action2 = DrawFromDeck + | DrawFromDiscard Color + deriving (Eq,Ord,Show,Read) + + +-- +-- the full game position, including active player +-- +data Position + = Position { active :: Player -- currently active player + , other :: Player -- other player + , discard :: Map Color Stack -- discard piles by color + , drawPile :: [Card] -- draw pile + , leadMove :: Maybe Move -- move leading to this position + , turn :: !Int -- action counter + , sign :: !Int -- maximizing/minimizing (1 or -1) + , round :: !Int -- current round + } + deriving (Eq,Read,Show) + + +-- end game condition (exausted draw pile) +endGame :: Position -> Bool +endGame = null . drawPile + + +-- list all possible moves from a game position +moves :: Position -> [Move] +moves g | endGame g = [] + | otherwise = [(a1,a2) | a2<-actions2, a1<-actions1, a1`compatible`a2] + where p = active g + cards = nub (playerHand p) -- remove duplicate investment cards + actions1 = ([Play (c,v) | (c,v)<-cards, + let vs=expeditions p!c, v`above`vs] ++ + [Discard (c,v) | (c,v)<-cards]) + actions2 = (DrawFromDeck : + [DrawFromDiscard c | (c,vs)<-Map.assocs (discard g), + not (null vs)]) + + + +-- list all subsequent positions from a position +positions :: Position -> [Position] +positions g + = [g' | m'<-moves g, let g'=snd (runSafePlay (play m') g)] + + + +-- check if the two parts of a move are compatible +compatible :: Action1 -> Action2 -> Bool +compatible (Discard (c,_)) (DrawFromDiscard c') = c/=c' +compatible _ _ = True + + +-- check if a card face is playable above a stack +above :: Face -> Stack -> Bool +v `above` vs = null vs || v>=head vs + + + +-- expand the game tree from a position +gametree :: Position -> Tree Position +gametree p = Node p (map gametree (positions p)) + + +-- estimate the best move using minimax with alpha-beta prunning +dynamic :: Int -> Int -> Position -> Eval (Maybe Move) +dynamic depth breadth + = minimax_ab (-inf) inf . + prunebreadth breadth . + highfirst . + fmap static_eval . + prunedepth depth . + gametree . + begin + where -- start position for minimaxing + begin :: Position -> Position + begin g = g { leadMove = Nothing + , sign = 1 + } + inf = toEval (maxBound :: Int) + + + +-- static evaluation function +static_eval :: Position -> Eval (Maybe Move) +static_eval g + = let est = expectedScore g (active g) - expectedScore g (other g) + in Eval (sign g*est) (leadMove g) + +{- + Compute the score estimate expected for a player + For each color: + * if no cards are played in an expedition, score zero + * otherwise, sum cards already player and weighted sum of unplayed cards + Uses fixed point a scaling factor of 10 + (i.e. -200 corresponds to -20 pts) + -} +expectedScore :: Position -> Player -> Int +expectedScore g p = sum [expect c vs | (c,vs)<-Map.assocs (expeditions p)] + where + -- number of open expeditions + n = Map.size $ Map.filter (not.null) (expeditions p) + -- expected value in a single expection + expect c [] = 0 + expect c vs1@(v':_) = score + where vs2 = [v | (c',v)<-playerHand p, c'==c && v>=v'] + vs3 = [v | v<-take 1 (discard g!c), + playing p==playing (active g) && v>=v'] + vs4 = [v | (c',v)<-drawPile g, c'==c && v>=v'] + -- playable multipliers + mult = 1+length (filter (==0) (vs1++vs2++vs3)) + score = mult*(-200 + + 10*sum vs1 -- cards in expedition + + 8*sum vs2 -- playable cards in hand + + 7*sum vs3 -- top card in discard + + w*sum vs4 -- playable cards in deck + ) + -- reduce the expected probability of drawing cards + -- when too many expeditions are open + w = if n>3 then 3 else 4 + + + + + + +--------------------------------------------------------------- +-- a monad for playing games +-- combination of state with error +-------------------------------------------------------------- +type Play a = StateT Position (Either String) a + +-- execute an action in the game monad +runPlay :: Play a -> Position -> Either String (a, Position) +runPlay = runStateT + +evalPlay :: Play a -> Position -> Either String a +evalPlay = evalStateT + +-- assumes the play action cannot fail +runSafePlay :: Play a -> Position -> (a, Position) +runSafePlay m g = either error id (runPlay m g) + +-- same as above but ignores result value +runSafePlay' :: Play a -> Position -> Position +runSafePlay' m g = snd (runSafePlay m g) + + +-- create a player +newPlayer :: String -> Playing -> Player +newPlayer n p + = Player { name=n, playing=p, hidden=[], shown=[], + expeditions=Map.empty, accumulated=0 + } + +-- generate a new game position +-- randomly draws cards for both players +newGame :: String -> String -> IO Position +newGame n1 n2 + = newRound (Position { active = newPlayer n1 Human + , other = newPlayer n2 Computer + , discard = Map.empty + , leadMove = Nothing + , drawPile = [] + , turn = 0 + , sign = 0 + , round = 0}) + + +-- reshuffle for a new roundu +newRound :: Position -> IO Position +newRound g + = do deck <- shuffleIO fullDeck + let (hand1,deck') = splitAt ncards deck + let (hand2,deck'')= splitAt ncards deck' + return $ g { active = p1 { hidden=sort hand1, shown=[], expeditions=empty } + , other = p2 { hidden=sort hand2, shown=[], expeditions=empty } + , discard = empty + , drawPile = deck'' + , leadMove = Nothing + , turn = 0 + , sign = 0 + , round = 1 + round g + } + where ncards = 8 + p1 = active g + p2 = other g + empty = Map.fromList $ zip colors (repeat []) + + + + +-- player's score +score :: Player -> Int +score p = Map.fold (+) 0 (Map.map scoreStack (expeditions p)) + +-- score a single expedition +scoreStack :: Stack -> Int +scoreStack [] = 0 +scoreStack vs = bonus + mult*(sum vs - 20) + where mult = 1 + length (filter (==0) vs) + bonus = if length vs>=8 then 20 else 0 + + + + +-- perform a move (comprising two actions) +play :: Move -> Play () +play m@(a1,a2) + = do playAction1 a1 + playAction2 a2 + appendMove m + switchPlayer + + +-- perform individual actions +playAction1 :: Action1 -> Play () +playAction1 (Play (c,v)) + = do p<-gets active + let vs = expeditions p ! c + when (not (v`above`vs)) $ + throwError "Must play cards in increasing order" + modify $ \g -> g { active = (p`withdraw`(c,v)) + { expeditions=Map.adjust (v:) c (expeditions p) } + , turn = 1+turn g + } + +playAction1 (Discard (c,v)) + = do p<-gets active + modify $ \g -> g { active = p`withdraw`(c,v) + , discard= Map.adjust (v:) c (discard g) + , turn = 1+turn g + } + +-- second action +-- result value is the card drawn +playAction2 :: Action2 -> Play Card +playAction2 DrawFromDeck + = do p<-gets active + cs<-gets drawPile + when (null cs) $ throwError "Draw pile is empty" + modify $ \g -> g { active = addHidden p (head cs) + , drawPile = tail cs + , turn = 1+turn g + } + return (head cs) + + +playAction2 (DrawFromDiscard c) + = do p<-gets active + d<-gets discard + let vs = d!c + when (null vs) $ throwError "Discard pile is empty" + modify $ \g -> g { active = addShown p (c,head vs) + , discard = Map.adjust tail c (discard g) + , turn = 1+turn g + } + return (c, head vs) + + + + + +-- switch active player +switchPlayer :: Play () +switchPlayer + = modify $ \g -> g { active = other g, + other = active g, + sign = negate (sign g) } + + + +-- append another move +appendMove :: Move -> Play () +appendMove m + = modify $ \g -> g {leadMove = leadMove g `mplus` Just m} + + + + +-- "Monte Carlo" AI playing +-- apply minimax starting on alternative positions +-- compatible with the public information and choose the "best" move +bestAverageMove :: Int -> Int -> [Position] -> Move +bestAverageMove depth breadth positions = move + where moves = [fromJust $ fromEval $ dynamic depth breadth g | g<-positions] + assocs = [(a, length l) | l@(a:_) <- group (sort moves)] + move = fst $ maximumBy (\x y -> compare (snd x) (snd y)) assocs + + +-- obtain a "variant" of a game position +-- shuffles the opponent's hand and deck +variant :: Position -> IO Position +variant g = do cards'<-shuffleIO cards + let (hidden', deck') = splitAt n cards' + return $ g {drawPile=deck', other= (other g) {hidden=hidden'}} + where cards = hidden (other g) ++ drawPile g + n = length (hidden (other g)) + + + +-- AI players +-- increase minimax depth towards the end game +-- and reduce the number of statistic variants +strongAI, fastAI :: Position -> IO Move +strongAI g + = do gs <- sequence [variant g | _<-[1..nvars]] + return (bestAverageMove depth breadth gs) + where + ncards = length (drawPile g) -- number of cards left + nvars = min 1 (2*ncards) + breadth = 3 + depth | ncards<15 = 8 + | ncards<30 = 6 + | otherwise = 4 + + +-- faster AI, for slower machines +fastAI g + = do gs <- sequence [variant g | _<-[1..nvars]] + return (bestAverageMove depth breadth gs) + where + ncards = length (drawPile g) -- number of cards left + nvars = min 1 (2*ncards) + breadth = 3 + depth | ncards<15 = 6 + | otherwise = 4 + + + +defaultAI = strongAI diff --git a/Main.hs b/Main.hs new file mode 100644 --- /dev/null +++ b/Main.hs @@ -0,0 +1,23 @@ +{- + Lost Cities card game: Main module + Pedro Vasconcelos, 2009 + pbv@dcc.fc.up.pt +-} +module Main where +import GUI +import Graphics.UI.WX hiding (when) +import System +import Random +import Control.Monad(when) + +-- application starts here +-- use any command line args to set random number seed +main :: IO () +main = do args <- getArgs + when (length args>0) $ + do let s = sum (map fromEnum (concat args)) + putStrLn ("Random number seed: "++show s) + setStdGen (mkStdGen s) + start gui + + diff --git a/Minimax.hs b/Minimax.hs new file mode 100644 --- /dev/null +++ b/Minimax.hs @@ -0,0 +1,74 @@ +{- + Minimax algorithm including alpha-beta prunning + Based on Bird & Walder "Introduction to Functional Programming" + Pedro Vasconcelos, 2008-2009 +-} +module Minimax where +import Data.Tree +import List + + +-- annotate something with an evaluation estimate +data Eval a = Eval !Int a deriving (Show) + +instance Eq (Eval a) where + (Eval x _) == (Eval y _) = x==y + +instance Ord (Eval a) where + compare (Eval x _) (Eval y _) = compare x y + +instance (Show a) => Num (Eval a) where + fromInteger n = Eval (fromIntegral n) undefined + (+) = undefined + (-) = undefined + (*) = undefined + abs = undefined + signum= undefined + negate (Eval x a) = Eval (-x) a + +toEval :: (Integral a, Show b) => a -> Eval b +toEval = fromIntegral + +fromEval :: Eval a -> a +fromEval (Eval _ x) = x + + +-- naive minimax algorithm +-- nodes are decorated with the static evaluation scores +minimax :: (Num a, Ord a) => Tree a -> a +minimax (Node n []) = n +minimax (Node n ts) = - minimum (map minimax ts) + + +-- minimax with alpha-beta prunning +minimax_ab :: (Num a, Ord a) => a -> a -> Tree a -> a +minimax_ab a b (Node x []) = a `max` x `min` b +minimax_ab a b (Node x ts) = cmx a ts + where cmx a [] = a + cmx a (t:ts) | a'>=b = a' + | otherwise = cmx a' ts + where a' = -(minimax_ab (-b) (-a) t) + + +-- heuristic to order subtrees with highest values first +highfirst, lowfirst :: (Ord a) => Tree a -> Tree a +highfirst (Node x ts) = Node x (sortBy cmp (map lowfirst ts)) + where cmp (Node x _) (Node y _) = compare y x + + +lowfirst (Node x ts) = Node x (sortBy cmp (map highfirst ts)) + where cmp (Node x _) (Node y _) = compare x y + + + + +-- some auxiliary rose tree functions +-- prune to a fixed depth +prunedepth :: Int -> Tree a -> Tree a +prunedepth n (Node x ts) + | n>0 = Node x (map (prunedepth (n-1)) ts) + | otherwise = Node x [] + +-- prune to a fixed breadth +prunebreadth :: Int -> Tree a -> Tree a +prunebreadth n (Node x ts) = Node x (map (prunebreadth n) $ take n ts) diff --git a/README b/README new file mode 100644 --- /dev/null +++ b/README @@ -0,0 +1,39 @@ +Lost Cities +----------- + +This is an implementation of a short two-player card game +in Haskell using the wxWidgets GUI toolkit. +This program allows you to play against a computer AI using +a minimax algorithm with alpha-beta prunning (based on +Bird and Wadler's presentation in the "Introduction +to Functional Programming"). + +The game is played with a deck of cards numbered from 2 to 10 +in 5 colors plus 3 "investment" cards for each color (marked with a +multiplication sign). The game progressed by playing cards +in columns of same colors of increasing value ("expeditions"); +starting a new expedition costs -20 points and the played +cards are summed; the investment cards multiply the result +(positive or negative). + +Crucially, the computer AI does not "cheat": unknown information +(i.e., the opponents hand and draw deck) is hidden +by considering possible scenarios that are compatible +with the known information. It seems to play only moderately well, +but still better than some online AI opponents I tried. + + +For more details check the Boardgamegeek page: +http://www.boardgamegeek.com/boardgame/50. + + +If you have any comments please drop me a line, + +Pedro Vasconcelos +pbv@dcc.fc.up.pt +Department of Computer Science +Faculty of Science, University of Porto, Portugal + + + + diff --git a/Setup.hs b/Setup.hs new file mode 100644 --- /dev/null +++ b/Setup.hs @@ -0,0 +1,2 @@ +import Distribution.Simple +main = defaultMain diff --git a/Utils.hs b/Utils.hs new file mode 100644 --- /dev/null +++ b/Utils.hs @@ -0,0 +1,57 @@ +{- + Miscelaneous utility functions + Pedro Vasconcelos, 2009 +-} + +module Utils where +import Random +import Data.Array.MArray +import Data.Array.IO + + +-- +-- Knuth-Fisher-Yates shuffling algorithm +-- +shuffleIO :: [a] -> IO [a] +shuffleIO xs + = do { arr <- newListArray (0,n) [0..n] :: IO (IOUArray Int Int) + ; sequence_ [do { j<-randomRIO (i,n) + ; t1<-readArray arr i + ; t2<-readArray arr j + ; writeArray arr i t2 + ; writeArray arr j t1 + } | i<-[0..n-1]] + ; sequence [do j<-readArray arr i + return (xs!!j) | i<-[0..n]] + } + where n = length xs - 1 + + + +-- an auxilary function to shuffle a list randomly +shuffleRnd :: RandomGen g => g -> [a] -> ([a], g) +shuffleRnd g xs = shuffle' g xs (length xs) + where + shuffle' :: RandomGen g => g -> [a] -> Int -> ([a], g) + shuffle' g xs n + | n>0 = let (k, g') = randomR (0,n-1) g + (xs',x:xs'') = splitAt k xs + (ys,g'') = shuffle' g' (xs' ++ xs'') (n-1) + in (x:ys, g'') + | otherwise = ([],g) + + +-- randomly-generated list of shuffles +nshuffles :: RandomGen g => g -> Int -> [a] -> ([[a]], g) +nshuffles g n cards + | n>0 = let (first,g')= shuffleRnd g cards + (rest, g'') = nshuffles g' (n-1) cards + in (first:rest, g'') + | otherwise = ([], g) + + + +-- deterministic shuffle +shuffle :: [a] -> [a] +shuffle [] = [] +shuffle (x:xs) = x : shuffle (reverse xs) diff --git a/lostcities.cabal b/lostcities.cabal new file mode 100644 --- /dev/null +++ b/lostcities.cabal @@ -0,0 +1,22 @@ +Name: lostcities +Version: 0.1 +Cabal-Version: >= 1.2 +License: GPL +License-file: LICENSE +Author: Pedro Vasconcelos +Maintainer: pbv@dcc.fc.up.pt +Homepage: http://www.dcc.fc.up.pt/~pbv/stuff/lostcities +Copyright: (c) 2009 Pedro Vasconcelos +Synopsis: An implementation of an adictive two-player card game +Description: Game originally designed by Reiner Knizia + In this implementation you play against the computer. +Build-Type: Simple +Category: Game +Extra-source-files: README + +Executable lostcities + Build-Depends: base>=3 && < 4, haskell98, containers, array, mtl, wx >= 0.11, wxcore >= 0.11 + Main-Is: Main.hs + Other-modules: Minimax LostCities GUI Utils + +