Announcement

Collapse
No announcement yet.

Search Result

Collapse
4 results in 0.0024 seconds.

You can also choose from the popular tags.


  • Towers of Hanoi

    Towers of Hanoi

    The classic Towers of Hanoi puzzle implemented as an external, graphical environment using Java and interfaced with Soar via SML. To see how the agent performs the task, you must launch the Soar debugger and tell it to connect to a remote Soar agent.

    The Towers of Hanoi is a puzzle that consists of three rods and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the...
    See more | Go to post

  • Tower of Hanoi SML Example

    Tower of Hanoi SML Example

    This project contains an example of a C++ based environment that interfaces with Soar. It implements a graphical version of the Towers of Hanoi. There is no option to load custom agents or interface to observe the agent trace. This project is an SML example, not a Towers of Hanoi test domain.

    The Towers of Hanoi is a puzzle that consists of three rods and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending...
    See more | Go to post

  • 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.
    Associated...
    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
Working...
X