queensgui/src/queens.h

/***************************************************************************
 *   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, SolutionContainer *sol, int set_size = 8, bool set_debug = false);
        void stop();
private:
        bool blocked;
        int size;
        bool debug;
        Solution solution;
        GUIUpdate* parent;

        SolutionContainer *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
1	torben	1	/***************************************************************************
2			* Copyright (C) 2005 by Torben Nielsen *
3			* torben@t-hoerup.dk *
4			* *
5			* This program is free software; you can redistribute it and/or modify *
6			* it under the terms of the GNU General Public License as published by *
7			* the Free Software Foundation; either version 2 of the License, or *
8			* (at your option) any later version. *
9			* *
10			* This program is distributed in the hope that it will be useful, *
11			* but WITHOUT ANY WARRANTY; without even the implied warranty of *
12			* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13			* GNU General Public License for more details. *
14			* *
15			* You should have received a copy of the GNU General Public License *
16			* along with this program; if not, write to the *
17			* Free Software Foundation, Inc., *
18			* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
19			***************************************************************************/
20			#ifndef QUEENS_H
21			#define QUEENS_H
22
23			#include <qthread.h>
24			#include "guiupdate.h"
25
26			class Solution;
27			class SolutionContainer;
28
29
30			/**
31			@author Torben Nielsen
32			*/
33
34			class Queens : public QThread
35			{
36			public:
37			Queens(GUIUpdate par, SolutionContainer sol, int set_size = 8, bool set_debug = false);
38			void stop();
39			private:
40			bool blocked;
41			int size;
42			bool debug;
43			Solution solution;
44			GUIUpdate* parent;
45
46			SolutionContainer *solutions;
47			//checkXXX() functions returns true if a section is usable
48			bool checkRows(int row, int col);
49			bool checkCols(int row, int col);
50			bool checkCross1(int row, int col);
51			bool checkCross2(int row, int col);
52
53			bool solve(int row, bool findAll);
54
55			void run();
56			bool solve();
57
58			void findAll();
59			};
60
61			#endif