main.cpp

#include <iostream>
#include "puzzleGame.cpp"
#include <ctime>
using namespace std;
int main() {
    // Intial goal state
    State goalState = State(-1);
    // Input total times to play 8-puzzle game
    int times;
    cout << "Please input times for 8-puzzle Game(computing avg running times):" << endl;
    cin >> times;
    // Input shuffle times for Intial State
    int shuffleTimes;
    cout << "Please input shuffle times for initial state:" << endl;
    cin >> shuffleTimes;
    // Intialize total time of each algorithm
    clock_t timeIDS = 0;
    clock_t timeGreedySearchByManhattanDistance = 0;
    clock_t timeGreedySearchByMisplacedDistance = 0;
    clock_t timeAStarSearchByManhattanDistance = 0;
    clock_t timeAStarSearchByMisplacedDistance = 0;
    // Intialize total time of each algorithm
    clock_t runningTimeIDS = 0;
    clock_t runningTimeGreedySearchByManhattanDistance = 0;
    clock_t runningTimeGreedySearchByMisplacedDistance = 0;
    clock_t runningTimeAStarSearchByManhattanDistance = 0;
    clock_t runningTimeAStarSearchByMisplacedDistance = 0;
    int count = times;
    // Intialize steps of each algorithm
    int stepIDS = 0;
    int stepGreedySearchByManhattanDistance = 0;
    int stepGreedySearchByMisplacedDistance = 0;
    int stepAStarSearchByManhattanDistance = 0;
    int stepAStarSearchByMisplacedDistance = 0; 
    // Intial Start State and Running each algorithm with Recording times
    while (count--) {
        cout << "You are in the " << times-count << "th 8-puzzle Game..." << endl;
        State startState = State(shuffleTimes);
        Game game = Game(startState, goalState);
        clock_t startTimer = clock();
        stepIDS += game.IDS(runningTimeIDS);
        clock_t IDSTimer = clock();
        stepGreedySearchByManhattanDistance += game.GreedySearchByManhattanDistance(runningTimeGreedySearchByManhattanDistance);
        clock_t GreedyTimerBy1 = clock();
        stepGreedySearchByMisplacedDistance += game.GreedySearchByMisplacedDistance(runningTimeGreedySearchByMisplacedDistance);
        clock_t GreedyTimerBy2 = clock();
        stepAStarSearchByManhattanDistance += game.AStarSearchByManhattanDistance(runningTimeAStarSearchByManhattanDistance);
        clock_t AStarTimerBy1 = clock();
        stepAStarSearchByMisplacedDistance += game.AStarSearchByMisplacedDistance(runningTimeAStarSearchByMisplacedDistance);
        clock_t AStarTimerBy2 = clock();
        timeIDS += (IDSTimer - startTimer);
        timeGreedySearchByManhattanDistance += (GreedyTimerBy1 - IDSTimer);
        timeGreedySearchByMisplacedDistance += (GreedyTimerBy2 - GreedyTimerBy1);
        timeAStarSearchByManhattanDistance += (AStarTimerBy1 - GreedyTimerBy2);
        timeAStarSearchByMisplacedDistance += (AStarTimerBy2 - AStarTimerBy1);
    }
    // Output Running Times of each algorithm
    cout << "Avg Running Time for IDS:" << runningTimeIDS / times / (double) CLOCKS_PER_SEC << endl;
    cout << "Avg Running Time for GreedySearchByManhattanDistance:" << runningTimeGreedySearchByManhattanDistance / times / (double) CLOCKS_PER_SEC << endl;
    cout << "Avg Running Time for GreedySearchByMisplacedDistance:" << runningTimeGreedySearchByMisplacedDistance / times / (double) CLOCKS_PER_SEC << endl;
    cout << "Avg Running Time for AStarSearchByManhattanDistance:" << runningTimeAStarSearchByManhattanDistance / times / (double) CLOCKS_PER_SEC << endl;
    cout << "Avg Running Time for AStarSearchByMisplacedDistance:" << runningTimeAStarSearchByMisplacedDistance / times / (double) CLOCKS_PER_SEC << endl;
    // Output Avg Steps of each algorithm
    cout << "Avg Step for IDS:" << stepIDS / (times * 1.0) << endl;
    cout << "Avg Step for GreedySearchByManhattanDistance:" << stepGreedySearchByManhattanDistance / (times * 1.0) << endl;
    cout << "Avg Step for GreedySearchByMisplacedDistance:" << stepGreedySearchByMisplacedDistance / (times * 1.0) << endl;
    cout << "Avg Step for AStarSearchByManhattanDistance:" << stepAStarSearchByManhattanDistance / (times * 1.0) << endl;
    cout << "Avg Step for AStarSearchByMisplacedDistance:" << stepAStarSearchByMisplacedDistance / (times * 1.0) << endl;
    // Output Times of each algorithm
    cout << "Avg Time(Running+ShowResults) for IDS:" << timeIDS / times / (double) CLOCKS_PER_SEC << endl;
    cout << "Avg Time(Running+ShowResults) for GreedySearchByManhattanDistance:" << timeGreedySearchByManhattanDistance / times / (double) CLOCKS_PER_SEC << endl;
    cout << "Avg Time(Running+ShowResults) for GreedySearchByMisplacedDistance:" << timeGreedySearchByMisplacedDistance / times / (double) CLOCKS_PER_SEC << endl;
    cout << "Avg Time(Running+ShowResults) for AStarSearchByManhattanDistance:" << timeAStarSearchByManhattanDistance / times / (double) CLOCKS_PER_SEC << endl;
    cout << "Avg Time(Running+ShowResults) for AStarSearchByMisplacedDistance:" << timeAStarSearchByMisplacedDistance / times / (double) CLOCKS_PER_SEC << endl;
    
    return 0;
}