Re: [OT] Towers of Hanoi with four pegs
Re: [OT] Towers of Hanoi with four pegs
- Subject: Re: [OT] Towers of Hanoi with four pegs
- From: Markian Hlynka <email@hidden>
- Date: Thu, 29 Apr 2004 15:15:57 -0600
I suggest that you want to use a single-agent search algorithm, such as
IDA*, or A* (pronounced "A-star"). I don't have any code, and if I did
I shouldn't give it for an assignment, but searching for single-agent
search, A* and Iterative-deepening-A* should give you a start on the
google search.
I'm afraid that's not going to be terribly simple to write for the
first time.
There is also a "method" for solving the three-peg puzzle that involves
turning the disks in opposite directions. I'm not sure if this
generalizes to 4 pegs or not... But I'm sure you can find info for that
in google.
hope that helps,
Markian
_______________________________________________
cocoa-dev mailing list | email@hidden
Help/Unsubscribe/Archives:
http://www.lists.apple.com/mailman/listinfo/cocoa-dev
Do not post admin requests to the list. They will be ignored.