No announcement yet.

Search Result

2 results in 0.0033 seconds.

You can also choose from the popular tags.

  • Tower of Hanoi (Recursive)

    Tower of Hanoi (Recursive)

    This agent solves the problem using a recursive strategy. It tries to always moves the biggest out of place disk into its correct position. The general description of the task from the Simple Tower of Hanoi Agent still applies.

    Soar capabilities
    • Basic PSCM functions: State Elaboration, Operator Proposal, Operator Evaluation, Internal Operator Application
    • Recursive problem solving
    Download LinksExternal Environment
    • None.
    Default Rules
    • None.
    See more | Go to post

  • Tower of Hanoi (Simple)

    Tower of Hanoi (Simple)

    This agent solves the Tower of Hanoi problems. This puzzle "involves three vertical pegs or posts and a number of doughnut-like disks of graduated sizes that fit on the pegs. At the outset, all the disks are arranged pyramidally on one of the pegs, say A, with the largest disk on the bottom. The task is to move all of the disks to another peg, C, say, under the constraints that (1) only one disk may be moved at a time, and (2) a disk may never be placed on top of another smaller than itself....
    See more | Go to post