Send Beginners mailing list submissions to
[email protected]
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
[email protected]
You can reach the person managing the list at
[email protected]
When replying, please edit your Subject line so it is more specific
than "Re: Contents of Beginners digest..."
Today's Topics:
1. Re: tower hanoi problem (Roelof Wobben)
2. Re: tower hanoi problem (Mike Meyer)
3. Re: tower hanoi problem (Roelof Wobben)
4. Re: tower hanoi problem (Mike Meyer)
5. Re: tower hanoi problem (YCH)
6. Re: tower hanoi problem (Roelof Wobben)
7. Re: tower hanoi problem (Roelof Wobben)
----------------------------------------------------------------------
Message: 1
Date: Sat, 14 Feb 2015 22:27:27 +0100
From: Roelof Wobben <[email protected]>
To: The Haskell-Beginners Mailing List - Discussion of primarily
beginner-level topics related to Haskell <[email protected]>
Subject: Re: [Haskell-beginners] tower hanoi problem
Message-ID: <[email protected]>
Content-Type: text/plain; charset=windows-1252; format=flowed
KC schreef op 14-2-2015 om 22:23:
>
> Hint:
>
> - think about what you need to do in each recursive step and in the
> base case
>
> - there is also an interesting way of viewing the problem
>
>
Check if I can do another step or check if the end case all disk are on
the last peg.
Im very curious what the interesting way is
------------------------------
Message: 2
Date: Sat, 14 Feb 2015 15:30:11 -0600
From: Mike Meyer <[email protected]>
To: The Haskell-Beginners Mailing List - Discussion of primarily
beginner-level topics related to Haskell <[email protected]>
Subject: Re: [Haskell-beginners] tower hanoi problem
Message-ID:
<CAD=7U2A0yX7s_BQqPhOMe9=3MyjFw7iGZUrX59no=pthuve...@mail.gmail.com>
Content-Type: text/plain; charset="utf-8"
On Sat, Feb 14, 2015 at 3:27 PM, Roelof Wobben <[email protected]> wrote:
> KC schreef op 14-2-2015 om 22:23:
>
>>
>> Hint:
>>
>> - think about what you need to do in each recursive step and in the base
>> case
>>
>> - there is also an interesting way of viewing the problem
>>
>>
>>
> Check if I can do another step or check if the end case all disk are on
> the last peg.
>
> Im very curious what the interesting way is
>
I suspect it's the iterative version that was already mentioned here. You
were close to discovering it when worked through the problem on paper.
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://www.haskell.org/pipermail/beginners/attachments/20150214/34941891/attachment-0001.html>
------------------------------
Message: 3
Date: Sat, 14 Feb 2015 22:35:25 +0100
From: Roelof Wobben <[email protected]>
To: The Haskell-Beginners Mailing List - Discussion of primarily
beginner-level topics related to Haskell <[email protected]>
Subject: Re: [Haskell-beginners] tower hanoi problem
Message-ID: <[email protected]>
Content-Type: text/plain; charset="us-ascii"
An HTML attachment was scrubbed...
URL:
<http://www.haskell.org/pipermail/beginners/attachments/20150214/e6d17d14/attachment-0001.html>
------------------------------
Message: 4
Date: Sat, 14 Feb 2015 15:38:01 -0600
From: Mike Meyer <[email protected]>
To: The Haskell-Beginners Mailing List - Discussion of primarily
beginner-level topics related to Haskell <[email protected]>
Subject: Re: [Haskell-beginners] tower hanoi problem
Message-ID:
<CAD=7U2CS0T-53y9ymFPyXdqRCUCd6=pimixvsxypqr6hwnn...@mail.gmail.com>
Content-Type: text/plain; charset="utf-8"
On Sat, Feb 14, 2015 at 3:35 PM, Roelof Wobben <[email protected]> wrote:
> I know.
>
> Eveyone says there is a pattern but I do not see it at the moment.
>
> Maybe I do the wrong first move with more then 2 disk.
>
> You can put the first disk on the second or the thirth peg.
>
Think about which peg you want the stack to end up on, and what your last
move HAS to be based on the rules.
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://www.haskell.org/pipermail/beginners/attachments/20150214/abf67f1b/attachment-0001.html>
------------------------------
Message: 5
Date: Sun, 15 Feb 2015 06:40:45 +0900
From: YCH <[email protected]>
To: haskell-beginners <[email protected]>
Subject: Re: [Haskell-beginners] tower hanoi problem
Message-ID:
<captm4gmntd_+yf567tuqvbkgaku+53yqvk1w37dqywic+0y...@mail.gmail.com>
Content-Type: text/plain; charset="utf-8"
Would you mind show code for only two cases? Just think about two cases.
hanoi 2 a b c
hanoi 3 a b c
2015. 2. 15. ?? 6:35? "Roelof Wobben" <[email protected]>?? ??:
> I know.
>
> Eveyone says there is a pattern but I do not see it at the moment.
>
> Maybe I do the wrong first move with more then 2 disk.
>
> You can put the first disk on the second or the thirth peg.
>
> Roelof
>
>
> Mike Meyer schreef op 14-2-2015 om 22:30:
>
>
>
> On Sat, Feb 14, 2015 at 3:27 PM, Roelof Wobben <[email protected]> wrote:
>
>> KC schreef op 14-2-2015 om 22:23:
>>
>>>
>>> Hint:
>>>
>>> - think about what you need to do in each recursive step and in the base
>>> case
>>>
>>> - there is also an interesting way of viewing the problem
>>>
>>>
>>>
>> Check if I can do another step or check if the end case all disk are on
>> the last peg.
>>
>> Im very curious what the interesting way is
>>
>
> I suspect it's the iterative version that was already mentioned here.
> You were close to discovering it when worked through the problem on paper.
>
>
> _______________________________________________
> Beginners mailing
> [email protected]http://www.haskell.org/mailman/listinfo/beginners
>
>
>
> _______________________________________________
> Beginners mailing list
> [email protected]
> http://www.haskell.org/mailman/listinfo/beginners
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://www.haskell.org/pipermail/beginners/attachments/20150215/12ad8d7a/attachment-0001.html>
------------------------------
Message: 6
Date: Sat, 14 Feb 2015 22:45:29 +0100
From: Roelof Wobben <[email protected]>
To: The Haskell-Beginners Mailing List - Discussion of primarily
beginner-level topics related to Haskell <[email protected]>
Subject: Re: [Haskell-beginners] tower hanoi problem
Message-ID: <[email protected]>
Content-Type: text/plain; charset="us-ascii"
An HTML attachment was scrubbed...
URL:
<http://www.haskell.org/pipermail/beginners/attachments/20150214/f81fb931/attachment-0001.html>
------------------------------
Message: 7
Date: Sat, 14 Feb 2015 22:46:37 +0100
From: Roelof Wobben <[email protected]>
To: The Haskell-Beginners Mailing List - Discussion of primarily
beginner-level topics related to Haskell <[email protected]>
Subject: Re: [Haskell-beginners] tower hanoi problem
Message-ID: <[email protected]>
Content-Type: text/plain; charset=windows-1252; format=flowed
YCH schreef op 14-2-2015 om 22:40:
>
> Would you mind show code for only two cases? Just think about two cases.
>
> hanoi 2 a b c
> hanoi 3 a b c
>
>
I do not have a code at the moment.
I try it on paper.
That one I can give you for both cases.
Roelof
------------------------------
Subject: Digest Footer
_______________________________________________
Beginners mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/beginners
------------------------------
End of Beginners Digest, Vol 80, Issue 27
*****************************************
