-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathsearch.h
61 lines (46 loc) · 2.06 KB
/
search.h
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/*
MIT License
Copyright(c) 2016-2017 Judd Niemann
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files(the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and / or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions :
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
#ifndef _SEARCH_H
#define _SEARCH_H 1
#include "movegen.h"
#include "hashtable.h"
namespace juddperft {
#define PV_SIZE 64
#define MAX_THREADS 64 // Hard limit for number of threads to use
#define ZERO_64 0ULL
#define SEARCH_STOPPED 0x80000000
struct PerftInfo{
int64_t nMoves;
int64_t nCapture;
int64_t nEPCapture;
int64_t nCastle;
int64_t nCastleLong;
int64_t nPromotion;
};
int64_t perft(ChessPosition P, int maxdepth, int depth, PerftInfo* pI); // Single-Threaded
void perftFast(const ChessPosition & P, int depth, int64_t & nNodes); // Simple, Hash-Table-using perft
void perftFastIterative(const ChessPosition & P, int depth, int64_t & nNodes); // Iterative version - Hash Table functionality still broken
void perftMT(ChessPosition P, int maxdepth, int depth, PerftInfo* pI); // Multi-Threaded driver for perft()
void perftFastMT(ChessPosition P, int depth, int64_t & nNodes); // Multi-Threaded driver for perftFast()
#ifndef NULL
#define NULL nullptr
#endif
} //namespace juddperft
#endif // _SEARCH_H