/home/archives/knight-path/branch.1/branch.0/delta5682.018/knight-path/solver.h

Go to the documentation of this file.

//
// knight-path - shortest knight path between two squares
// Copyright (C) 2011 Peter Miller
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 3 of the License, or (at
// your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with this program. If not, see <http://www.gnu.org/licenses/>.
//

#ifndef KNIGHT_PATH_SOLVER_H
#define KNIGHT_PATH_SOLVER_H

#include <boost/shared_ptr.hpp>
#include <list>

#include <knight-path/position.h>

class solver
{
public:
    typedef boost::shared_ptr<solver> pointer;

    typedef std::list<position> list_t;

    virtual ~solver();

public:
    static pointer factory(const char *name);

    virtual list_t solve(const position &from, const position &to) = 0;

    static void list_algorithms(void);

protected:
    solver();

private:
    solver(const solver &rhs);

    solver &operator=(const solver &rhs);
};

#endif // KNIGHT_PATH_SOLVER_H