华容道是什么意思,三国~华容道~是什么意思(15)

MessageBox(hwnd,s,"华容道",MB_OK);
hrd.OutputStep();
current_step=0;
SetTimer(hwnd, 1,700, NULL);
}
else
{
sprintf(s,"此局无解") ;
MessageBox(hwnd,s,"华容道",MB_OK);
}
break;
}
case 1001:
{
GetDlgItemText(hwnd,1002,str,80);
for (i=0;i<5;i++)
for(j=0;j<4;j++)
{
display_node[i][j]=(int)(str[m])-0x30;
m++;
}
InvalidateRect(hwnd, NULL, 1);
break;
}
}
break;
case WM_PAINT:
{
hdc = BeginPaint(hwnd,&pa);
PatBlt(memdc, 0, 0, rect.right, rect.bottom, PATCOPY);
//Draw
for (i=0;i<5;i++)
for(j=0;j<4;j++)
{
if (display_node[i][j]==SOLDIER)
RoundRect(memdc,inity+j*grid+j*interspace,initx+i*grid+i*interspace,
inity+(j+1)*grid+j*interspace,initx+(i+1)*grid+i*interspace,arc,arc);
if (display_node[i][j]>=GENERAL1 && display_node[i][j]<=GENERAL5)
{
if (i<4)
if (display_node[i][j]==display_node[i+1][j])
RoundRect(memdc,inity+j*grid+j*interspace,initx+i*grid+i*interspace,
inity+(j+1)*grid+j*interspace,initx+(i+2)*grid+(i+1)*interspace,arc,arc);
if (j<3)
if (display_node[i][j]==display_node[i][j+1])
RoundRect(memdc,inity+j*grid+j*interspace,initx+i*grid+i*interspace,
inity+(j+2)*grid+(j+1)*interspace,initx+(i+1)*grid+i*interspace,arc,arc);
}
if (display_node[i][j]==CAOCAO)
if (i<4 && j<3)
if( display_node[i+1][j+1]==CAOCAO)
RoundRect(memdc,inity+j*grid+j*interspace,initx+i*grid+i*interspace,
inity+(j+2)*grid+(j+1)*interspace,initx+(i+2)*grid+(i+1)*interspace,arc,arc);
}
//////////////////////////////////
BitBlt(hdc,0,0,rect.right,rect.bottom,memdc,0,0,SRCCOPY);
EndPaint(hwnd,&pa);
break;
}
case WM_DESTROY:
{
PostQuitMessage (0); /* send a WM_QUIT to the message queue */
DeleteDC(memdc);
DeleteObject(hbit);
break;
}
default: /* for messages that we don't deal with */
return DefWindowProc (hwnd, message, wParam, lParam);
}
return 0;
}
///HRD_Calculate.h 的程序写法
/////////////////////////////////////////////////
//华容道解法1.0.0.1
//此解法可得出最优解
//横刀立马 81步
//最后修改时间 2004.9.22 晚上
//
/////////////////////////////////////////////////
#include "HRD_Calculate.h"
hrd_calculate::hrd_calculate()
{
//申请状态表空间
first= new s_node[MAX_NODES];
}
hrd_calculate::~hrd_calculate()
{
delete[] first;
}
void hrd_calculate::NodeToSNode(node * pnode,s_node* psnode)
{
int i,j;
__int8 hgeneral=8,vgeneral=9;