/home/archives/knight-path/branch.1/branch.0/delta5682.018/knight-path/solver/brute_force.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_BRUTE_FORCE_H
#define KNIGHT_PATH_SOLVER_BRUTE_FORCE_H

#include <knight-path/solver.h>

class solver_brute_force:
    public solver
{
public:
    virtual ~solver_brute_force();

    // See base class for documentation.
    list_t solve(const position &from, const position &to);

    static pointer create(void);

private:
    solver_brute_force();

    list_t shortest_solution;

    void ply(const position &from, const position &to, const list_t &progress);

    solver_brute_force(const solver_brute_force &rhs);

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

#endif // KNIGHT_PATH_SOLVER_BRUTE_FORCE_H