WaspAI/ProblemNode.h at master · pashneal/WaspAI · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#pragma once
#include <list>
#include <unordered_map>
#include <unordered_set>
#include "Bitboard.h"
#include <stack>

using namespace std;

class ProblemNodeContainer {
		//TODO: this might be an optimization worth trying
		//unordered_map <int, list<Bitboard>> perimeterHashTable;

		unordered_map <int, list<Bitboard>> locationHashTable;

		unordered_set <int> problemNodeHashes;

		list <Bitboard> getProblemNodesAtLocation(int,unsigned long long);

		int hash(int, unsigned long long);

		void updateVisible(Bitboard&);
		void remove(Bitboard&);
		//requires that currentPiece is actally in *allPieces? (maybe?)
		void insert(Bitboard&);

	public:

		Bitboard *allPieces;
		Bitboard visibleProblemNodes;

		ProblemNodeContainer(){};
		ProblemNodeContainer(Bitboard*);

		bool problemNodeExists(Bitboard&);

		void insertPiece(Bitboard&);
		void removePiece(Bitboard&);

		void clear();

		void findAllProblemNodes();

		Bitboard getPerimeter(Bitboard&);

		bool contains(Bitboard&);
};