📄 eveluation.cpp
字号:
// COPYRIGHT NOTES
// ---------------
// This source code is a part of chess which is an example of <Game Programing guide>.
// You may use, compile or redistribute it as part of your application
// for free.
// You cannot redistribute sources without the official agreement of the author.
// If distribution of you application which contents code below was occured, place
// e-mail <hidebug@hotmail.com> on it is to be appreciated.
// This code can be used WITHOUT ANY WARRANTIES on your own risk.
//
// Spring Wang <hidebug@hotmail.com>
// ---------------
// 版权声明
// ---------------
// 本文件所含之代码是《人机博弈程序设计指南》的范例程序中国象棋的一部分
// 您可以免费的使用, 编译 或者作为您应用程序的一部分。
// 但，您不能在未经作者书面许可的情况下分发此源代码。
// 如果您的应用程序使用了这些代码，在您的应用程序界面上
// 放入 e-mail <hidebug@hotmail.com> 是令人欣赏的做法。
// 此代码并不含有任何保证，使用者当自承风险。
//
// 王小春 <hidebug@hotmail.com>
// Eveluation.cpp: implementation of the CEveluation class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "chess.h"
#include "Eveluation.h"
#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#endif
const int BA0[10][9]=
{
{0, 0, 0, 0, 0, 0, 0, 0, 0},
{90,90,110,120,120,120,110,90,90},
{90,90,110,120,120,120,110,90,90},
{70,90,110,110,110,110,110,90,70},
{70,70,70, 70, 70, 70, 70,70,70},
{0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0},
};
const int BA1[10][9]=
{
{0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0},
{70,70,70, 70, 70,70, 70,70, 70},
{70,90,110,110,110,110,110,90,70},
{90,90,110,120,120,120,110,90,90},
{90,90,110,120,120,120,110,90,90},
{0, 0, 0, 0, 0, 0, 0, 0, 0},
};
int CEveluation:: GetBingValue(int x, int y, BYTE CurSituation[][9])
{
if (CurSituation[y][x] == R_PAWN)
return BA0[y][x];
if (CurSituation[y][x] == B_PAWN)
return BA1[y][x];
return 0;
}
//////////////////////////////////////////////////////////////////////
// Construction/Destruction
//////////////////////////////////////////////////////////////////////
CEveluation::CEveluation()
{
m_BaseValue[B_KING] = BASEVALUE_KING;
m_BaseValue[B_CAR] = BASEVALUE_CAR;
m_BaseValue[B_HORSE] = BASEVALUE_HORSE;
m_BaseValue[B_BISHOP] = BASEVALUE_BISHOP;
m_BaseValue[B_ELEPHANT] = BASEVALUE_ELEPHANT;
m_BaseValue[B_CANON] = BASEVALUE_CANON;
m_BaseValue[B_PAWN] = BASEVALUE_PAWN;
m_BaseValue[R_KING] = BASEVALUE_KING;
m_BaseValue[R_CAR] = BASEVALUE_CAR;
m_BaseValue[R_HORSE] = BASEVALUE_HORSE;
m_BaseValue[R_BISHOP] = BASEVALUE_BISHOP;
m_BaseValue[R_ELEPHANT] = BASEVALUE_ELEPHANT;
m_BaseValue[R_CANON] = BASEVALUE_CANON;
m_BaseValue[R_PAWN] = BASEVALUE_PAWN;
m_FlexValue[B_KING] = FLEXIBILITY_KING;
m_FlexValue[B_CAR] = FLEXIBILITY_CAR;
m_FlexValue[B_HORSE] = FLEXIBILITY_HORSE;
m_FlexValue[B_BISHOP] = FLEXIBILITY_BISHOP;
m_FlexValue[B_ELEPHANT] = FLEXIBILITY_ELEPHANT;
m_FlexValue[B_CANON] = FLEXIBILITY_CANON;
m_FlexValue[B_PAWN] = FLEXIBILITY_PAWN;
m_FlexValue[R_KING] = FLEXIBILITY_KING;
m_FlexValue[R_CAR] = FLEXIBILITY_CAR;
m_FlexValue[R_HORSE] = FLEXIBILITY_HORSE;
m_FlexValue[R_BISHOP] = FLEXIBILITY_BISHOP;
m_FlexValue[R_ELEPHANT] = FLEXIBILITY_ELEPHANT;
m_FlexValue[R_CANON] = FLEXIBILITY_CANON;
m_FlexValue[R_PAWN] = FLEXIBILITY_PAWN;
}
CEveluation::~CEveluation()
{
}
int count=0;
int CEveluation::Eveluate(BYTE position[10][9], BOOL bIsRedTurn)
{
int i, j, k;
int nChessType, nTargetType;
count++;
memset(m_chessValue,0, 360);
memset(m_AttackPos,0, 180);
memset(m_GuardPos,0, 90);
memset(m_FlexibilityPos, 0, 90);
for(i = 0; i < 10; i++)
for(j = 0; j < 9; j++)
{
if(position[i][j] != NOCHESS)
{
nChessType = position[i][j];
GetRelatePiece(position, j, i);
for (k = 0; k < nPosCount; k++)
{
nTargetType = position[RelatePos[k].y][RelatePos[k].x];
if (nTargetType == NOCHESS)
{
m_FlexibilityPos[i][j]++;
}
else
{
if (IsSameSide(nChessType, nTargetType))
{
m_GuardPos[RelatePos[k].y][RelatePos[k].x]++;
}else
{
m_AttackPos[RelatePos[k].y][RelatePos[k].x]++;
m_FlexibilityPos[i][j]++;
switch (nTargetType)
{
case R_KING:
if (!bIsRedTurn)
return 18888;
break;
case B_KING:
if (bIsRedTurn)
return 18888;
break;
default:
m_AttackPos[RelatePos[k].y][RelatePos[k].x] += (30 + (m_BaseValue[nTargetType] - m_BaseValue[nChessType])/10)/10;
break;
}
}
}
}
}
}
for(i = 0; i < 10; i++)
for(j = 0; j < 9; j++)
{
if(position[i][j] != NOCHESS)
{
nChessType = position[i][j];
m_chessValue[i][j]++;
m_chessValue[i][j] += m_FlexValue[nChessType] * m_FlexibilityPos[i][j];
m_chessValue[i][j] += GetBingValue(j, i, position);
}
}
int nHalfvalue;
for(i = 0; i < 10; i++)
for(j = 0; j < 9; j++)
{
if(position[i][j] != NOCHESS)
{
nChessType = position[i][j];
nHalfvalue = m_BaseValue[nChessType]/16;
m_chessValue[i][j] += m_BaseValue[nChessType];
if (IsRed(nChessType))
{
if (m_AttackPos[i][j])
{
if (bIsRedTurn)
{
if (nChessType == R_KING)
{
m_chessValue[i][j]-= 20;
}
else
{
m_chessValue[i][j] -= nHalfvalue * 2;
if (m_GuardPos[i][j])
m_chessValue[i][j] += nHalfvalue;
}
}
else
{
if (nChessType == R_KING)
return 18888;
m_chessValue[i][j] -= nHalfvalue*10;
if (m_GuardPos[i][j])
m_chessValue[i][j] += nHalfvalue*9;
}
m_chessValue[i][j] -= m_AttackPos[i][j];
}
else
{
if (m_GuardPos[i][j])
m_chessValue[i][j] += 5;
}
}
else
{
if (m_AttackPos[i][j])
{
if (!bIsRedTurn)
{
if (nChessType == B_KING)
{
m_chessValue[i][j]-= 20;
}
else
{
m_chessValue[i][j] -= nHalfvalue * 2;
if (m_GuardPos[i][j])
m_chessValue[i][j] += nHalfvalue;
}
}
else
{
if (nChessType == B_KING)
return 18888;
m_chessValue[i][j] -= nHalfvalue*10;
if (m_GuardPos[i][j])
m_chessValue[i][j] += nHalfvalue*9;
}
m_chessValue[i][j] -= m_AttackPos[i][j];
}
else
{
if (m_GuardPos[i][j])
m_chessValue[i][j] += 5;
}
}
}
}
int nRedValue = 0;
int nBlackValue = 0;
for(i = 0; i < 10; i++)
for(j = 0; j < 9; j++)
{
nChessType = position[i][j];
// if (nChessType == R_KING || nChessType == B_KING)
// m_chessValue[i][j] = 10000;
if (nChessType != NOCHESS)
{
if (IsRed(nChessType))
{
nRedValue += m_chessValue[i][j];
}
else
{
nBlackValue += m_chessValue[i][j];
}
}
}
if (bIsRedTurn)
{
return nRedValue - nBlackValue;
}
else
{
return nBlackValue-nRedValue ;
}
}
CEveluation::AddPoint(int x, int y)
{
RelatePos[nPosCount].x = x;
RelatePos[nPosCount].y = y;
nPosCount++;
}
int CEveluation::GetRelatePiece(BYTE position[10][9], int j, int i)
{
nPosCount = 0;
BYTE nChessID;
BYTE flag;
int x,y;
nChessID = position[i][j];
switch(nChessID)
{
case R_KING:
case B_KING:
for (y = 0; y < 3; y++)
for (x = 3; x < 6; x++)
if (CanTouch(position, j, i, x, y))
AddPoint(x, y);
for (y = 7; y < 10; y++)
for (x = 3; x < 6; x++)
if (CanTouch(position, j, i, x, y))
AddPoint(x, y);
break;
case R_BISHOP:
for (y = 7; y < 10; y++)
for (x = 3; x < 6; x++)
if (CanTouch(position, j, i, x, y))
AddPoint(x, y);
break;
case B_BISHOP:
for (y = 0; y < 3; y++)
for (x = 3; x < 6; x++)
if (CanTouch(position, j, i, x, y))
AddPoint(x, y);
break;
case R_ELEPHANT:
case B_ELEPHANT:
x=j+2;
y=i+2;
if(x < 9 && y < 10 && CanTouch(position, j, i, x, y))
AddPoint(x, y);
x=j+2;
y=i-2;
if(x < 9 && y>=0 && CanTouch(position, j, i, x, y))
AddPoint(x, y);
x=j-2;
y=i+2;
if(x>=0 && y < 10 && CanTouch(position, j, i, x, y))
AddPoint(x, y);
x=j-2;
y=i-2;
if(x>=0 && y>=0 && CanTouch(position, j, i, x, y))
AddPoint(x, y);
break;
case R_HORSE:
case B_HORSE:
x=j+2;
y=i+1;
if((x < 9 && y < 10) &&CanTouch(position, j, i, x, y))
AddPoint(x, y);
x=j+2;
y=i-1;
if((x < 9 && y >= 0) &&CanTouch(position, j, i, x, y))
AddPoint(x, y);
x=j-2;
y=i+1;
if((x >= 0 && y < 10) &&CanTouch(position, j, i, x, y))
AddPoint(x, y);
x=j-2;
y=i-1;
if((x >= 0 && y >= 0) &&CanTouch(position, j, i, x, y))
AddPoint(x, y);
x=j+1;
y=i+2;
if((x < 9 && y < 10) &&CanTouch(position, j, i, x, y))
AddPoint(x, y);
x=j-1;
y=i+2;
if((x >= 0 && y < 10) &&CanTouch(position, j, i, x, y))
AddPoint(x, y);
x=j+1;
y=i-2;
if((x < 9 && y >= 0) &&CanTouch(position, j, i, x, y))
AddPoint(x, y);
x=j-1;
y=i-2;
if((x >= 0 && y >= 0) &&CanTouch(position, j, i, x, y))
AddPoint(x, y);
break;
case R_CAR:
case B_CAR:
x=j+1;
y=i;
while(x < 9)
{
if( NOCHESS == position[y][x] )
AddPoint(x, y);
else
{
AddPoint(x, y);
break;
}
x++;
}
x = j-1;
y = i;
while(x >= 0)
{
if( NOCHESS == position[y][x] )
AddPoint(x, y);
else
{
AddPoint(x, y);
break;
}
x--;
}
x=j;
y=i+1;//
while(y < 10)
{
if( NOCHESS == position[y][x])
AddPoint(x, y);
else
{
AddPoint(x, y);
break;
}
y++;
}
x = j;
y = i-1;//⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -