AI Tutor

AI TUTOR FINAL VERSION

Developer: Horace, Cheok MAK
Supervisor: Assc/Prof. Ingrid Zukerman
Dept of Computer Science
Monash University
Victoria, Australia


AI TUTOR MENU

Introduction

Teaching computer algorithms by animating the alogorithms is not a new idea. Basically, algorithm animation is the process of animating the computer programs into graphical views, and it is also a subset of software visualisation. Computer alogorithms are found to be understood easily by their graphical animation views. AI Tutor has been developed to teach three typical AI searhc techniques: Breadth first search, Depth first search and A* heuristic search. The important aim of AI Tutor is: unlike traditional algorithm animation approaches, It not only performs algorithm animation, but also provides an interactive environment, leading students to reach the solution of the problems.

AI Tutor consists of two different teaching policies: "Demonstration" and "Try". The Demonstration policy shows how the internal search has been built gradually to solve the problem by highlighting the executing algorithm. The Try teaching policy shows the process of solving the problem with actual student involvement. Students have the chance to make decisions for which node is being expanded. Then, the AI Tutor will validate the decision of the students and give appropriate responses. It leads the student towards the correct goal state.