Project #16308 - C/C++ programming

Task
Develop two efficient and well-documented search programs based on A* algorithm (from Text Book: Artificial intelligence, by Elaine Rich, Kevin Knight, McGraw-hill ) and Recursive-Best-First Search (Artificial Intelligence: A Modern Approach, by S. Russell and P. Norvig, Prentice-Hall, Third Edition, 2010.) using C or C++ language to solve TOWERS OF HANOI problem.

Run both programs separately with heuristic function to solve the problem for as many values of n (number of discs) as you can run within 30 minutes of execution time, starting with n=3. For each run you should provide the execution time, memory used, the number of nodes generated, and the number of nodes expanded.


http://itee.uq.edu.au/~comp3701/_Tutorials/_tute4s?print=1

check the above link, which might be helpful.
Detailed explanation: YES
Specific requirements:
* The algorithms used for a* search & recursive best first search must be from the text books mentioned.
* Must use C/C++ language only.
* clearly mention heuristic function using.
* output the result in best possible understandable way.

Subject Computer
Due By (Pacific Time) 11/09/2013 12:00 am
Report DMCA
TutorRating
pallavi

Chat Now!

out of 1971 reviews
More..
amosmm

Chat Now!

out of 766 reviews
More..
PhyzKyd

Chat Now!

out of 1164 reviews
More..
rajdeep77

Chat Now!

out of 721 reviews
More..
sctys

Chat Now!

out of 1600 reviews
More..
sharadgreen

Chat Now!

out of 770 reviews
More..
topnotcher

Chat Now!

out of 766 reviews
More..
XXXIAO

Chat Now!

out of 680 reviews
More..
All Rights Reserved. Copyright by AceMyHW.com - Copyright Policy