Send Beginners mailing list submissions to
beginners@haskell.org
To subscribe or unsubscribe via the World Wide Web, visit
http://www.haskell.org/mailman/listinfo/beginners
or, via email, send a message with subject or body 'help' to
beginners-requ...@haskell.org
You can reach the person managing the list at
beginners-ow...@haskell.org
When replying, please edit your Subject line so it is more specific
than "Re: Contents of Beginners digest..."
Today's Topics:
1. Re: Is http://hackage.haskell.org/packages/hackage.html
having a challenging serving up archive.tar? (Henk-Jan van Tuyl)
2. Re: Game of Life try (KC)
----------------------------------------------------------------------
Message: 1
Date: Sat, 12 Jan 2013 00:04:39 +0100
From: "Henk-Jan van Tuyl" <hjgt...@chello.nl>
Subject: Re: [Haskell-beginners] Is
http://hackage.haskell.org/packages/hackage.html having a challenging
serving up archive.tar?
To: haskell-cafe <haskell-c...@haskell.org>, "Haskell Beginners"
<beginners@haskell.org>, KC <kc1...@gmail.com>
Message-ID: <op.wqrrp1tepz0...@zen5.arnhem.chello.nl>
Content-Type: text/plain; charset=iso-8859-15; format=flowed;
delsp=yes
On Wed, 09 Jan 2013 20:05:07 +0100, KC <kc1...@gmail.com> wrote:
> :)
>
I can't download it either.
Regards,
Henk-Jan van Tuyl
--
http://Van.Tuyl.eu/
http://members.chello.nl/hjgtuyl/tourdemonad.html
Haskell programming
--
------------------------------
Message: 2
Date: Fri, 11 Jan 2013 17:19:31 -0800
From: KC <kc1...@gmail.com>
Subject: Re: [Haskell-beginners] Game of Life try
To: ???????? ??????? <emanuela.moll...@gmail.com>
Cc: beginners@haskell.org
Message-ID:
<camlkxynxfj+c5a1k_yqbdubavkfgdjk1gti0sh-h9wfcrn2...@mail.gmail.com>
Content-Type: text/plain; charset=windows-1251
Thinking about Bird's handling of Sudoku; it may be efficiently
possible to represent colonies as lists (or trees).
Then one just has to consider the merging and splitting of colonies.
Usually, all the space in a cell array is not used anyway. :)
On Fri, Jan 4, 2013 at 11:27 PM, KC <kc1...@gmail.com> wrote:
> You might want to look at the chapter on Sudoku (and the whole book)
> in "Pearls of Functional Algorithm Design" by Richard Bird.
>
>
> On Fri, Jan 4, 2013 at 12:41 PM, ???????? ???????
> <emanuela.moll...@gmail.com> wrote:
>> Hello all! :) I'm new to Haskell and I would like to try to implement a
>> simple version of Game of Life. I can imagine it in C++ for example, but I
>> have a little difficulties in Haskell. All I can think for is a mutable
>> array with all elements - 0 in the beginning and the user to be able to
>> write in the coordinates of the cells, which are alive and this cells to
>> become 1. Then to iterate through the array (but I'm not sure if I can
>> iterate, there is no 'while' here) and to make the changes (but maybe I will
>> need a new array for the changes, because when the first change happens, it
>> will affect the result). Also I was thinking of how to make it visible, so I
>> tried to make all 0-s red and all 1-s green, and after each iteration to
>> clear the screen with ANSI so that it looks a bit like animation, but none
>> of these ideas work... Here is an orientation in my ideas:
>>
>> import Data.Array.IO
>> import System.Console.ANSI
>>
>> main :: IO ()
>> main = do
>> arr <- newArray ((1,1), (10,10)) 0 :: IO (IOArray (Int, Int) Int)
>> writeAraay arr (1,1) 1
>> a <- readArray (1,1)
>> setSGR [SetColor Foreground Dull Red]
>> putStr [a]
>>
>> Could you please suggest me what is a good place to store the information
>> about my cells (mutable, unmutable array, lists, tuples...) and any ideas
>> and tutorials at all would be really appreciated! Thank you very much in
>> advance! :)
>>
>> _______________________________________________
>> Beginners mailing list
>> Beginners@haskell.org
>> http://www.haskell.org/mailman/listinfo/beginners
>>
>
>
>
> --
> --
> Regards,
> KC
--
--
Regards,
KC
------------------------------
_______________________________________________
Beginners mailing list
Beginners@haskell.org
http://www.haskell.org/mailman/listinfo/beginners
End of Beginners Digest, Vol 55, Issue 13
*****************************************
