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
62
63
|
$NetBSD: patch-aj,v 1.2 2011/11/25 21:52:33 joerg Exp $
--- search.cpp.orig 2000-04-30 09:56:56.000000000 +0000
+++ search.cpp
@@ -4,7 +4,7 @@
/* Search Functions */
#define TIME_FLAG 123456
-#include <iostream.h>
+#include <iostream>
#include <stdio.h>
#if DEBUG
@@ -12,7 +12,10 @@
#include <stdlib.h>
#endif
-#include <fstream.h>
+#include <fstream>
+
+using namespace std;
+
#include "define.h"
#include "chess.h"
#include "const.h"
@@ -181,7 +184,7 @@ move search(position p, int time_limit,
last_depth = 1;
// adjusting hash code for game stage
- or(p.hcode, stage_code[stage]);
+ hash_or(p.hcode, stage_code[stage]);
// initialize history table
for(int i = 0; i < 64; i++)
@@ -261,7 +264,7 @@ move search(position p, int time_limit,
}
// adjusting hash code for game stage
- or(p.hcode, stage_code[stage]);
+ hash_or(p.hcode, stage_code[stage]);
if(!xboard && !ALLEG && post) {
cout << "\nnode_count = " << node_count
@@ -423,7 +426,7 @@ outfile << space_string << "->Ply: " <<
if(ply) {
// add hash code for this position to position list
p_list[turn+ply-1] = sp[ply].hcode;
- or(p_list[turn+ply-1], stage_code[stage]);
+ hash_or(p_list[turn+ply-1], stage_code[stage]);
// fifty move rule
if(sp[ply].fifty >= 100) return(0);
@@ -470,8 +473,8 @@ outfile << space_string << "->Ply: " <<
{
node_count++;
sp[ply+1] = sp[ply]; sp[ply+1].wtm ^= 1;
- or(sp[ply+1].hcode,wtm);
- or(sp[ply+1].hcode,btm);
+ hash_or(sp[ply+1].hcode,wtm);
+ hash_or(sp[ply+1].hcode,btm);
sp[ply+1].last.t = NOMOVE; sp[ply+1].ep = 0;
sp[ply+1].material = -sp[ply+1].material;
sp[ply+1].fifty = 0;
|
