-
Notifications
You must be signed in to change notification settings - Fork 0
/
minishogi.h
125 lines (101 loc) · 2.37 KB
/
minishogi.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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <stack>
#include <map>
#include <algorithm>
#include <time.h>
#include <iostream>
#include <fstream>
using namespace std;
#ifndef MINISHOGI_H
#define MINISHOGI_H
#define INF 100000000
class minishogi
{
private:
char table[5][5];
public:
//table elements
char hold[6] = { 'K','G','S','C','F','W' };
short A[6]={0};
short B[6]={0};
bool controlA[5][5];
bool controlB[5][5];
bool movable[5][5];
//states & features
short Minions[10]={0};
short BigChessForce[2]={0};
bool SpecialForm[2]={0}; //
double MinionsWeight[10];
double HoldWeight[6];
double BigChessForceWeight[2];
double SpecialFormWeight[2];
//feature generating function
void GetMinionState(bool);
void GetBigChessForce(bool);
void GetSpecialForm(bool);
void GetAllStates(bool);
void ClearStates();
//heuristic file stream
void LoadHeuristic();
void SaveHeuristic();
//table function
char GetChess(int, int);
void PutChess(int, int, char);
void initial();
void PrintTable();
bool IsEnemy(int,int,bool);
bool IsFriend(int,int,bool);
bool IsEmpty();
double TableScore(bool);
//movement function
bool movement(int, int, int, int, bool);
bool Move_K(int, int, int, int , bool);
bool Move_G(int, int, int, int, bool);
bool Move_S(int, int, int, int, bool);
bool Move_C(int, int, int, int, bool);
bool Move_F(int, int, int, int, bool);
bool Move_W(int, int, int, int, bool);
//game body operation function
void Take(int, int, bool);
int HitIndex(char, int, int, bool);
void hit(int, int, int, bool);
int IFupgrade(char, int, int, int);
bool win();
bool checkking();
//control table function
void initialControl();
void GetControl(bool);
void PrintControlA();
//movable table function
void initialMovable();
void GetMovable(int,int);
void Movable_K(int,int,bool);
void Movable_G(int,int,bool);
void Movable_S(int,int,bool);
void Movable_C(int,int,bool);
void Movable_H(int,int,bool);
void Movable_F(int,int,bool);
void Movable_U(int,int,bool);
void Movable_W(int,int,bool);
void PrintMovable();
};
class node
{
private:
minishogi Shogi;
bool id;
public:
node* FatherNode=NULL;
vector<node*> ChildNode;
int TryTimes=0;
int WinTimes=0;
void SetTable(minishogi);
void SetID(bool);
minishogi GetTable();
bool GetID();
void FreeTree(node*);
};
#endif