Puzzle.h

// Puzzle.h -- The Puzzle problem represented as a CSP.

/*
 * Copyright (C) 2003-2004 Tudor Hulubei <tudor@hulubei.net>.
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as
 * published by the Free Software Foundation; either version 2, 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 Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA,
 * 02111-1307, USA.
 */

// $Id: Puzzle_8h-source.html,v 1.1 2005/05/25 12:37:18 tudor Exp $

#ifndef _CSP_EXAMPLES_Puzzle_H
#define _CSP_EXAMPLES_Puzzle_H


#ifndef __cplusplus
#error Must use C++ for the type Puzzle.
#endif


#include "values/Int.h"
#include "variables/Int.h"


CSP_NAMESPACE_BEGIN(Puzzle)


using namespace std;


typedef csp::values::Int Value;
typedef csp::Domain Domain;
class Variable;


class NonConsecutiveConstraint :
    public csp::Constraint
{
  public:
    NonConsecutiveConstraint() : csp::Constraint() {}
    virtual bool check() const;
};


class DifferentConstraint :
    public csp::Constraint
{
  public:
    DifferentConstraint() : csp::Constraint() {}
    virtual bool check() const;
};


class Problem :
    public csp::Problem
{
  public:
    Problem(csp::RandomSequence& randomSequence/*int puzzle*/);
    Problem(const Problem& problem);

    virtual wstring name() const { return L"Puzzle"; }

    void addNonConsecutiveConstraint(int index0, int index1);
    void addDifferentConstraint(int index0, int index1);

    virtual wostream& printSolution(wostream& wos) const;

    virtual wostream& print(wostream& wos) const
    {
        wos << L"Problem: Puzzle" << endl;
        return csp::Problem::print(wos);
    }

  private:
    void constructor(/*int puzzle*/);

    // We keep the nodes in this vector just to be able to find them
    // quickly based on their index.
    vector<Variable*> m_nodes;
};


class Variable :
    public csp::variables::Int
{
  public:
    Variable(const Problem& problem, int min, int max, int index) :
        csp::variables::Int(problem, min, max), m_index(index) {}

    int index() const { return m_index; }

  private:
    int m_index;
};


CSP_NAMESPACE_END(Puzzle)


#endif // _CSP_EXAMPLES_Puzzle_H

// Local Variables:
// mode: C++
// End:

---