/***************************************************************************
 *   Copyright (C) 2005 by Torben Nielsen   *
 *   torben@t-hoerup.dk   *
 *                                                                         *
 *   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 2 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, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *
 ***************************************************************************/
#ifndef QUEENS_H
#define QUEENS_H

#include <qthread.h>
#include "guiupdate.h"

class Solution;
class SolutionContainer;


/**
@author Torben Nielsen
*/

class Queens : public QThread
{
public:
	Queens(GUIUpdate *par, Solution* sol,SolutionContainer *container, int set_size = 8, bool set_debug = false);
	void stop();
private:
	bool m_blocked;
	int m_size;
	bool m_debug;
	Solution* m_solution;
	GUIUpdate* m_parent;

	SolutionContainer* m_solutions;
	
//checkXXX() functions returns true if a section is usable
	bool checkRows(int row, int col);
	bool checkCols(int row, int col);
	bool checkCross1(int row, int col);
	bool checkCross2(int row, int col);

	bool solve(int row, bool findAll);
	
	void run();
	bool solve();

	void findAll();
};

#endif