TTracer

I will rule the world with this artificial tri-force! TTracer is a teaching tool for use in Computer Science classrooms. Specifically, it was created for use in artificial intelligence and game theory domains. It is written in C++, using Qt 4. It is actively developed for Windows XP and GNU/Linux, and would probably port to OSX with relative ease.

News

(2007.12.15) Feature Requests

A TTracer wishlist page has been added for Chris Gore and others. Email Ray for an account.

(2007.11.19) Long Names

The Elastic interface now supports extra wide nodes for extra long names. (See gallery below)

(2007.10.03) Bug Fixes

The “stable” version no longer crashes on the second load. Also, a problem in the single-agent goal line was squashed.

(2007.09.28) New code spec in the works

I am writing a new code spec to govern future versions of GNAT.

(2007.09.24) "Elastic" interface C++ prototype

The new interface design, dubbed Elastic, is approaching completion for Single Agent graphs. It can soon be merged into the Stable tree.

History

GNAT: Graphical AI Tracer

The GNAT research project was started in Fall 2005 at UMR by students Bob Beuhler and Matt Dissinger. It was later developed by students Ray Myers and Kyle Owen. Ray Myers is the current maintainer.

The goal of GNAT is to assist in the learning and grading of the particular style of algorithm traces used in Dr. Daniel Tauritz's Artificial Intelligence class, CS 347.

TTracer

In Fall of 2007, plans were made to release GNAT to the public. In order to avoid a name collision with GNU GNAT, the name of the project is being tentatively changed to TTracer.

License

TTracer will be made available under the GNU GPLv2 beginning December 2007.

Download

Features

Arbitrary graphs and trees may be searched using any of the algorithms below. Traces are generated on the fly and may be saved in LaTeX format for use on exam keys.

  • Single-Agent
    • Depth-First Search
    • Breadth-First Search
    • Uniform Cost Search
    • Greedy Best-First Search
    • A* Search
  • Adversarial
    • Minimax
    • Alpha-Beta Minimax
  • Adversarial (non-deterministic)
    • Expectiminimax

Gallery

  • Nodes with long names

Nodes can be ellipses now -- not just circles.

  • GNAT LaTeX output

A simple example from a 2006 exam key

  • TTracer Scripting interface

Contact

  • Ray Myers - Maintainer
  • Bob Buehler - Original author
  • Dr. Daniel Tauritz - Designer
  • Greetings! We are conducting poker en francais. To all who are interested in playing games. Visit our site for more information and this online game is free for all! So what are you waiting for? Play now and enjoy our site! Happy gaming!
 
start.txt · Last modified: 2010/06/03 16:50 by 119.111.124.194
 
Recent changes RSS feed Creative Commons License Donate Powered by PHP Valid XHTML 1.0 Valid CSS Debian Driven by DokuWiki