head 1.4; access; symbols pkgsrc-2014Q2:1.3.0.10 pkgsrc-2014Q2-base:1.3 pkgsrc-2014Q1:1.3.0.8 pkgsrc-2014Q1-base:1.3 pkgsrc-2013Q4:1.3.0.6 pkgsrc-2013Q4-base:1.3 pkgsrc-2013Q3:1.3.0.4 pkgsrc-2013Q3-base:1.3 pkgsrc-2013Q2:1.3.0.2 pkgsrc-2013Q2-base:1.3 pkgsrc-2013Q1:1.2.0.12 pkgsrc-2013Q1-base:1.2 pkgsrc-2012Q4:1.2.0.10 pkgsrc-2012Q4-base:1.2 pkgsrc-2012Q3:1.2.0.8 pkgsrc-2012Q3-base:1.2 pkgsrc-2012Q2:1.2.0.6 pkgsrc-2012Q2-base:1.2 pkgsrc-2012Q1:1.2.0.4 pkgsrc-2012Q1-base:1.2 pkgsrc-2011Q4:1.2.0.2 pkgsrc-2011Q4-base:1.2 pkgsrc-2011Q3:1.1.0.66 pkgsrc-2011Q3-base:1.1 pkgsrc-2011Q2:1.1.0.64 pkgsrc-2011Q2-base:1.1 pkgsrc-2011Q1:1.1.0.62 pkgsrc-2011Q1-base:1.1 pkgsrc-2010Q4:1.1.0.60 pkgsrc-2010Q4-base:1.1 pkgsrc-2010Q3:1.1.0.58 pkgsrc-2010Q3-base:1.1 pkgsrc-2010Q2:1.1.0.56 pkgsrc-2010Q2-base:1.1 pkgsrc-2010Q1:1.1.0.54 pkgsrc-2010Q1-base:1.1 pkgsrc-2009Q4:1.1.0.52 pkgsrc-2009Q4-base:1.1 pkgsrc-2009Q3:1.1.0.50 pkgsrc-2009Q3-base:1.1 pkgsrc-2009Q2:1.1.0.48 pkgsrc-2009Q2-base:1.1 pkgsrc-2009Q1:1.1.0.46 pkgsrc-2009Q1-base:1.1 pkgsrc-2008Q4:1.1.0.44 pkgsrc-2008Q4-base:1.1 pkgsrc-2008Q3:1.1.0.42 pkgsrc-2008Q3-base:1.1 cube-native-xorg:1.1.0.40 cube-native-xorg-base:1.1 pkgsrc-2008Q2:1.1.0.38 pkgsrc-2008Q2-base:1.1 cwrapper:1.1.0.36 pkgsrc-2008Q1:1.1.0.34 pkgsrc-2008Q1-base:1.1 pkgsrc-2007Q4:1.1.0.32 pkgsrc-2007Q4-base:1.1 pkgsrc-2007Q3:1.1.0.30 pkgsrc-2007Q3-base:1.1 pkgsrc-2007Q2:1.1.0.28 pkgsrc-2007Q2-base:1.1 pkgsrc-2007Q1:1.1.0.26 pkgsrc-2007Q1-base:1.1 pkgsrc-2006Q4:1.1.0.24 pkgsrc-2006Q4-base:1.1 pkgsrc-2006Q3:1.1.0.22 pkgsrc-2006Q3-base:1.1 pkgsrc-2006Q2:1.1.0.20 pkgsrc-2006Q2-base:1.1 pkgsrc-2006Q1:1.1.0.18 pkgsrc-2006Q1-base:1.1 pkgsrc-2005Q4:1.1.0.16 pkgsrc-2005Q4-base:1.1 pkgsrc-2005Q3:1.1.0.14 pkgsrc-2005Q3-base:1.1 pkgsrc-2005Q2:1.1.0.12 pkgsrc-2005Q2-base:1.1 pkgsrc-2005Q1:1.1.0.10 pkgsrc-2005Q1-base:1.1 pkgsrc-2004Q4:1.1.0.8 pkgsrc-2004Q4-base:1.1 pkgsrc-2004Q3:1.1.0.6 pkgsrc-2004Q3-base:1.1 pkgsrc-2004Q2:1.1.0.4 pkgsrc-2004Q2-base:1.1 pkgsrc-2004Q1:1.1.0.2 pkgsrc-2004Q1-base:1.1; locks; strict; comment @# @; 1.4 date 2014.09.11.16.59.16; author jperkin; state dead; branches; next 1.3; commitid b7OUQ9vL3mT5TWPx; 1.3 date 2013.04.30.22.20.58; author joerg; state Exp; branches; next 1.2; 1.2 date 2011.11.25.21.52.33; author joerg; state Exp; branches; next 1.1; 1.1 date 2004.02.14.04.31.56; author kristerw; state Exp; branches; next ; desc @@ 1.4 log @Update games/exchess to v7.31beta, this package's first update in 14 years. The primary motivator for the upgrade is to improve the book generation time, which is now several times faster (builds were failing with CPU ulimit of 1 hour on 3GHz Xeon E5's with the previous version). This new version even supports multiple cores, though that isn't enabled at this time. There appear to have been many other updates, but there is no ChangeLog and there aren't even any intermediate versions for download (hence using the current beta version). Upstream unfortunately makes it as difficult as possible to see the history of this package. @ text @$NetBSD: patch-aj,v 1.3 2013/04/30 22:20:58 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 +#include #include #if DEBUG @@@@ -12,7 +12,10 @@@@ #include #endif -#include +#include + +using namespace std; + #include "define.h" #include "chess.h" #include "const.h" @@@@ -24,7 +27,7 @@@@ /*----------------------- Search function ---------------------*/ // Driver for the search process. 1st initialize important data // structures, the do iterative deeping until time runs out. -move search(position p, int time_limit, int T) +my_move search(position p, int time_limit, int T) { char outstring[60], mstring[10]; int g, done, pvi; @@@@ -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 @@@@ -351,7 +354,7 @@@@ move search(position p, int time_limit, // It is updated by doing a mem-copy of the principle continuation // found at deeper depths to this depth + the move at this depth // is stuffed in first. -inline void pc_update(move pcmove, int ply) +inline void pc_update(my_move pcmove, int ply) { int pci; pc[ply][ply].t = pcmove.t; @@@@ -395,7 +398,7 @@@@ int pvs(int alpha, int beta, int depth, int score, old_depth = depth, mate_ext = 0; int mcount = 0, first = 1, razor = 0; int razor_margin, total_pieces; - move smove, gmove, bmove = nomove; + my_move smove, gmove, bmove = nomove; #if DEBUG // Debug archiving of search to a file @@@@ -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; @ 1.3 log @Avoid conflict with C++11's std::move. @ text @d1 1 a1 1 $NetBSD: patch-aj,v 1.2 2011/11/25 21:52:33 joerg Exp $ @ 1.2 log @Fix build with modern GCC @ text @d1 1 a1 1 $NetBSD: patch-aj,v 1.1 2004/02/14 04:31:56 kristerw Exp $ d26 9 d53 18 @ 1.1 log @Make the package build when using gcc-3.3. @ text @d1 1 a1 1 $NetBSD$ d3 24 a26 3 --- search.cpp.orig Sat Feb 14 04:30:46 2004 +++ search.cpp Sat Feb 14 04:32:41 2004 @@@@ -181,7 +181,7 @@@@ d35 1 a35 1 @@@@ -261,7 +261,7 @@@@ d44 1 a44 1 @@@@ -423,7 +423,7 @@@@ d53 1 a53 1 @@@@ -470,8 +470,8 @@@@ @