dnomd343
/
HRD_Database
mirror of https://github.com/dnomd343/HRD_Database
1
0
Fork 0
Code Issues Projects Releases Wiki Activity
Browse Source

add HRD_analy

master
Dnomd343 5 years ago
parent
d9d2ef09a2
commit
2aec669556
2 changed files with 223 additions and 281 deletions
Whitespace
Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL
Split View
Diff Options
Show Stats Download Patch File Download Diff File
  1. 419
      HRD_analy.cpp
  2. 57
      HRD_analy.h

419
main.cpp → HRD_analy.cpp
View File

@ -1,150 +1,84 @@
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <fstream>
using namespace std;
#include "HRD_analy.h"
ifstream File_Input;
ofstream File_Output;
struct Case_struct {
bool freeze[4][5]; // true -> no move ; false -> can move
unsigned char status[4][5]; // 0xFF -> undefined ; 0xFE -> space
unsigned char type[15]; // 0 -> 2 * 2 ; 1 -> 2 * 1 ; 2 -> 1 * 2 ; 3 -> 1 * 1
unsigned long long code;
};
vector <vector <Case_struct *> > Layer; // 储存全部层数据的节点
vector <vector <vector <int> > > Hash; // 哈希表
vector <vector <vector <int> > > Layer_Next; // 子节点数据
vector <vector <vector <int> > > Layer_Source; // 父节点数据
vector <int> int_vector;
int layer_num, layer_index; // layer_num: 当前扫描节点的层编号 layer_index: 当前扫描节点的层中编号
// 布局的基本参数
int min_solution_step; // 最少的步数
int min_solution_num; // 最少步解的个数
vector <unsigned long long> min_solution_case; // 所有最少步解
vector <unsigned int> solution_step; // 所有解对应的步数
int solution_num; // 解的个数
vector <unsigned long long> solution_case; // 所有解
int farthest_step; // 最远布局的步数
int farthest_num; // 最远布局的个数
vector <unsigned long long> farthest_case; // 所有最远的布局
void debug(Case_struct &dat);
unsigned long long Change_int (char str[10]);
string Change_str(unsigned long long dat);
bool Parse_Code(Case_struct &dat, unsigned long long Code);
void Get_Code(Case_struct &dat);
void Find_Sub_Case(Case_struct &dat, int &num, int x, int y, bool addr[4][5]);
void Build_Case(Case_struct &dat, int &num, int x, int y, bool addr[4][5]);
void Find_Next_Case(Case_struct &dat_raw);
void Add_Case(Case_struct *dat);
void Calculate(unsigned long long code);
void Free_Data();
void Analyse_Case(unsigned long long code);
void Sort(vector <unsigned long long> &dat);
int main() {
cout << "Klotski Calculator by Dnomd343" << endl;
cout << "start" << endl;
//Calculate(0x4FEA13400); // 0x1A9BF0C00 0x2CF519C00 0x652D7F000 0x2B1877C00
struct Case_struct {
unsigned int id;
unsigned long long code;
int min_solution_step;
int min_solution_num;
vector <unsigned long long> min_solution_case;
vector <unsigned int> solution_step;
int solution_num;
vector <unsigned long long> solution_case;
int farthest_step;
int farthest_num;
vector <unsigned long long> farthest_case;
};
vector <Case_struct> Cases;
Case_struct empty_case;
char str[9];
int i, j;
File_Input.open("test.txt");
while (File_Input.eof() != true) {
File_Input >> str;
Cases.push_back(empty_case);
Cases[Cases.size() - 1].id = Cases.size() - 1;
Cases[Cases.size() - 1].code = Change_int(str);
}
File_Input.close();
for (i = 0; i < Cases.size(); i++) {
cout << Change_str(Cases[i].code) << "...";
Analyse_Case(Cases[i].code);
Cases[i].min_solution_step = min_solution_step;
Cases[i].solution_num = solution_num;
Cases[i].min_solution_num = min_solution_num;
Cases[i].solution_case = solution_case;
Cases[i].solution_step = solution_step;
Cases[i].min_solution_case = min_solution_case;
Cases[i].farthest_step = farthest_step;
Cases[i].farthest_num = farthest_num;
Cases[i].farthest_case = farthest_case;
cout << "OK -> " << i + 1 << "/" << Cases.size() << endl;
}
cout << "Output farthest.csv...";
File_Output.open("farthest.csv");
File_Output << "id,farthest_step,farthest_num,farthest_case";
for (i = 0; i < Cases.size(); i++) {
File_Output << endl;
File_Output << Cases[i].id << ",";
File_Output << Cases[i].farthest_step << ",";
File_Output << Cases[i].farthest_num << ",";
for (j = 0; j < Cases[i].farthest_case.size(); j++) {
File_Output << Change_str(Cases[i].farthest_case[j]);
if (j != Cases[i].farthest_case.size() - 1) {File_Output << "-";}
void HRD_analy::Output_Detail(string File_name) { // 输出分析结果到文件
unsigned int i, j, k;
vector <Case_cal *> case_list;
if (quiet == false) {
cout << "Output into: " << File_name << " ...";
}
File_Output.open(File_name);
File_Output << "[Min_solution_step]" << endl;
File_Output << min_solution_step << endl;
File_Output << "[Min_solution_case]" << endl;
File_Output << "num: " << min_solution_num << endl;
for (i = 0; i < min_solution_case.size(); i++) {
File_Output << Change_str(min_solution_case[i]) << endl;
}
File_Output << "[Farthest_step]" << endl;
File_Output << farthest_step << endl;
File_Output << "[Farthest_case]" << endl;
File_Output << "num: " << farthest_num << endl;
for (i = 0; i < farthest_case.size(); i++) {
File_Output << Change_str(farthest_case[i]) << endl;
}
File_Output << "[Solution]" << endl;
File_Output << "num: " << solution_num << endl;
for (i = 0; i < solution_case.size(); i++) {
File_Output << Change_str(solution_case[i]) << "(" << solution_step[i] << ")" << endl;
}
File_Output << "[Layer_Size]" << endl;
for (i = 0; i < Layer.size(); i++) {
File_Output << i << " -> " << Layer[i].size() << endl;
}
File_Output << "[Layer]" << endl;
for (i = 0; i < Layer.size(); i++) {
for (j = 0; j < Layer[i].size(); j++) {
File_Output << "(" << i << "," << j << ") -> ";
File_Output << Change_str((*Layer[i][j]).code) << endl;
}
}
File_Output.close();
cout << "OK" << endl;
cout << "Output min_solution.csv...";
File_Output.open("min_solution.csv");
File_Output << "id,min_solution_step,min_solution_num,min_solution_case";
for (i = 0; i < Cases.size(); i++) {
File_Output << "[Next]" << endl;
for (i = 0; i < Layer.size(); i++) {
for (j = 0; j < Layer[i].size(); j++) {
case_list = (*(*Layer[i][j]).adjacent).next_case;
File_Output << "(" << i << "," << j << ") ->";
for (k = 0; k < case_list.size(); k++) {
File_Output << " (" << (*case_list[k]).layer_num;
File_Output << "," << (*case_list[k]).layer_index << ")";
}
File_Output << endl;
File_Output << Cases[i].id << ",";
File_Output << Cases[i].min_solution_step << ",";
File_Output << Cases[i].min_solution_num << ",";
for (j = 0; j < Cases[i].min_solution_case.size(); j++) {
File_Output << Change_str(Cases[i].min_solution_case[j]);
if (j != Cases[i].min_solution_case.size() - 1) {File_Output << "-";}
}
}
File_Output.close();
cout << "OK" << endl;
cout << "Output solution.csv...";
File_Output.open("solution.csv");
File_Output << "id,solution_num,solution_case";
for (i = 0; i < Cases.size(); i++) {
File_Output << "[Source]" << endl;
for (i = 0; i < Layer.size(); i++) {
for (j = 0; j < Layer[i].size(); j++) {
case_list = (*(*Layer[i][j]).adjacent).source_case;
File_Output << "(" << i << "," << j << ") <-";
for (k = 0; k < case_list.size(); k++) {
File_Output << " (" << (*case_list[k]).layer_num;
File_Output << "," << (*case_list[k]).layer_index << ")";
}
File_Output << endl;
File_Output << Cases[i].id << ",";
File_Output << Cases[i].solution_num << ",";
for (j = 0; j < Cases[i].solution_case.size(); j++) {
File_Output << Change_str(Cases[i].solution_case[j]);
File_Output << "(" << Cases[i].solution_step[j] << ")";
if (j != Cases[i].solution_case.size() - 1) {File_Output << "-";}
}
}
File_Output.close();
cout << "OK" << endl;
cout << "All Done!" << endl;
cout << "bye..." << endl;
return 0;
if (quiet == false) {
cout << "done" << endl;
}
}
void Analyse_Case(unsigned long long code) { // 分析输入编码的各种参数 (输入编码必须无误)
void HRD_analy::Analyse_Case(unsigned long long code) { // 分析输入编码的各种参数 (输入编码必须无误)
vector < vector <bool> > solution_flag;
vector <unsigned long long> temp;
int i, j, k;
unsigned int i, j, k;
farthest_step = -1; // 初始化farthest
farthest_num = 0;
farthest_case.clear();
@ -159,14 +93,14 @@ void Analyse_Case(unsigned long long code) { // 分析输入编码的各种参
for (i = 0; i < solution_flag.size(); i++) {
solution_flag[i].resize(Layer[i].size());
}
// 获取最远端情况
farthest_step = Layer.size() - 1; // 计算最远布局的步数
for (i = 0; i < Layer[farthest_step].size(); i++) { // 找到所有最远的布局
farthest_case.push_back((*Layer[farthest_step][i]).code);
}
farthest_num = farthest_case.size();
Sort(farthest_case); //得到的结果进行排序
sort(farthest_case.begin(), farthest_case.end()); //得到的结果进行排序
// 获取最少步解
for (i = 0; i < Layer.size(); i++) {
for (j = 0; j < Layer[i].size(); j++) {
if (((*Layer[i][j]).code >> 32) == 0xD) { // 2 * 2块在出口位置
@ -184,8 +118,9 @@ void Analyse_Case(unsigned long long code) { // 分析输入编码的各种参
}
}
min_solution_num = min_solution_case.size();
Sort(min_solution_case); // 得到的结果进行排序
sort(min_solution_case.begin(), min_solution_case.end()); // 得到的结果进行排序
// 获取全部解
vector <Case_cal *> case_list;
solution_case = min_solution_case; // 同步最少步解到所有解序列中
for (i = 0; i < solution_case.size(); i++) { // 初始化已知部分的solution_step
solution_step.push_back(min_solution_step);
@ -193,8 +128,10 @@ void Analyse_Case(unsigned long long code) { // 分析输入编码的各种参
for (i = 0; i < Layer.size() - 1; i++) { // 遍历除最后一层外的所有层
for (j = 0; j < Layer[i].size(); j++) { // 遍历层内元素
if (solution_flag[i][j] == true) { // 若该元素被标识
for (k = 0; k < Layer_Next[i][j].size(); k++) { // 遍历其下一步
solution_flag[i + 1][Layer_Next[i][j][k]] = true; // 标识
case_list = (*(*Layer[i][j]).adjacent).next_case;
for (k = 0; k < case_list.size(); k++) { // 遍历其下一步
//solution_flag[i + 1][Layer_Next[i][j][k]] = true;
solution_flag[i + 1][(*case_list[k]).layer_index] = true; // 标识
}
}
}
@ -208,117 +145,117 @@ void Analyse_Case(unsigned long long code) { // 分析输入编码的各种参
}
}
}
Sort(temp); // 将得到的结果进行排序
sort(temp.begin(), temp.end()); // 将得到的结果进行排序
for (k = 0; k < temp.size(); k++) { // 将temp内容加入solution_case中
solution_case.push_back(temp[k]);
}
}
solution_num = solution_case.size();
if (quiet == true) {return;} // 若quiet为true则不输出
cout << "---------------------------" << endl;
cout << "farthest_step = " << farthest_step << endl;
cout << "farthest_num = " << farthest_num << endl;
cout << "farthest_case -> " << endl;
for (i = 0; i < farthest_case.size(); i++) {
cout << " " << Change_str(farthest_case[i]) << endl;
}
cout << "---------------------------" << endl;
cout << "min_solution_step = " << min_solution_step << endl;
cout << "min_solution_num = " << min_solution_num << endl;
cout << "min_solution_case -> " << endl;
for (i = 0; i < min_solution_case.size(); i++) {
cout << " " << Change_str(min_solution_case[i]) << endl;
}
cout << "---------------------------" << endl;
cout << "solution_num = " << solution_num << endl;
cout << "solution_case(solution_step) -> " << endl;
for (i = 0; i < solution_case.size(); i++) {
cout << " " << Change_str(solution_case[i]) << "(" << solution_step[i] << ")" << endl;
}
cout << "---------------------------" << endl;
}
void Sort(vector <unsigned long long> &dat) { // 将输入的vector排序 (从小到大)
void HRD_analy::Free_Data() { // 释放上一次的计算结果
unsigned int i, j;
if (dat.size() == 0) {return;} // 空的则退出
for (i = 0; i < dat.size() - 1; i++) { // 冒泡排序
for (j = 0; j < dat.size() - 1 - i; j++) {
if (dat[j] >= dat[j + 1]) {
swap(dat[j], dat[j + 1]);
}
}
}
}
void Free_Data() { //释放数据
for (int i = 0; i < Layer.size(); i++) { // 释放Layer中指向的全部节点
for (int j = 0; j < Layer[i].size(); j++) {
for (i = 0; i < Layer.size(); i++) { // 释放Layer中指向的全部节点
for (j = 0; j < Layer[i].size(); j++) {
delete (*Layer[i][j]).adjacent;
delete Layer[i][j];
}
}
Layer.clear(); // 清空层数据
Hash.clear(); // 清空哈希表
Layer_Next.clear(); // 清空子节点标识
Layer_Source.clear(); // 清空父节点标识
for (i = 0; i < 0x10000; i++) { // 清空哈希表
Layer_hash[i].clear();
}
}
void Calculate(unsigned long long code) { // 计算输入编码的全部层数据
Free_Data(); // 释放上一次计算的数据
Case_struct *dat = new Case_struct;
vector <Case_struct *> empty_layer;
vector <vector <int> > int_2nd_vector;
vector <vector <int> > hash_layer;
hash_layer.resize(0x100); // 单层哈希索引设定为8位
Parse_Code(*dat, code); // 解译输入编码
Layer.push_back(empty_layer); // 添加首层
Hash.push_back(hash_layer);
Layer_Next.push_back(int_2nd_vector);
Layer_Source.push_back(int_2nd_vector);
Layer[0].push_back(dat); // 添加根节点
Hash[0][0xff & (code >> 24)].push_back(0);
Layer_Next[0].push_back(int_vector);
Layer_Source[0].push_back(int_vector);
layer_num = layer_index = 0; // 定义入口为根节点
void HRD_analy::Calculate(unsigned long long code) {
Free_Data(); // 初始化数据结构
Case_cal *start = new Case_cal;
(*start).adjacent = new Case_near;
Parse_Code(*start, code); // 解译输入编码
Layer.resize(1); // 创建第0层
Layer[0].push_back(start); // 加入根节点
(*start).layer_num = (*start).layer_index = 0; // 初始化根节点编号
Layer_hash[0xffff & ((*start).code >> 16)].push_back(start); // 根节点加入哈希表
now_move_num = now_move_index = 0; // 从根节点开始运算
while (1 == 1) { // 创建死循环
if (layer_index == 0) { // 若在计算层的第一个元素
Layer.push_back(empty_layer); // 则新增一层
Hash.push_back(hash_layer);
Layer_Next.push_back(int_2nd_vector);
Layer_Source.push_back(int_2nd_vector);
}
Find_Next_Case(*Layer[layer_num][layer_index]); // 寻找子布局
if (layer_index == Layer[layer_num].size() - 1) { // 若在层的最后一个元素
if (Layer[layer_num + 1].size() == 0) { // 若下一层是空的
if (now_move_index == 0) { // 若在计算层的第一个元素
Layer.resize(Layer.size() + 1); // 则新增一层
}
now_move_case = Layer[now_move_num][now_move_index]; // 记录当前正在查找的节点
Find_Next_Case(*now_move_case); // 寻找节点的子布局
if (now_move_index == Layer[now_move_num].size() - 1) { // 若在层的最后一个元素
if (Layer[now_move_num + 1].size() == 0) { // 若下一层是空的
break; // 已全部搜索完毕 退出搜索循环
}
layer_num++; // 计算目标移到下一层第一个元素
layer_index = 0;
now_move_num++; // 计算目标移到下一层第一个元素
now_move_index = 0;
if (quiet == false) {
cout << now_move_num << " -> " << Layer[now_move_num].size() << endl;
}
} else { // 不是最后一个元素
layer_index++; // 计算目标移到下一元素
now_move_index++; // 计算目标移到下一元素
}
}
Layer.pop_back(); // 移除最后的空层
Hash.pop_back();
Layer_Next.pop_back();
Layer_Source.pop_back();
}
void Add_Case(Case_struct *dat) { // 新节点若不重复即可以加入
int x, y, k, num;
int hash_index = (0xff & ((*dat).code >> 24)); // 取编码低24 ~ 32位作为哈希索引
num = layer_num; // 扫描目标为当前计算所在层
for (k = 0; k < Hash[num][hash_index].size(); k++) { // 遍历对应索引
if ((*Layer[num][Hash[num][hash_index][k]]).code == (*dat).code) { // 若发现重复
delete dat; // 释放不加入的节点
return; // 退出
}
}
num++; // 向下一层
for (k = 0; k < Hash[num][hash_index].size(); k++) { // 遍历对应索引
if ((*Layer[num][Hash[num][hash_index][k]]).code == (*dat).code) { // 若发现重复
void HRD_analy::Add_Case(Case_cal *dat) { // 将计算得到的节点加入层级中
unsigned int i, x, y;
Case_cal *repeat_case;
int hash_index = 0xffff & ((*dat).code >> 16); // 取得哈希索引
for (i = 0; i < Layer_hash[hash_index].size(); i++) { // 遍历索引内容
repeat_case = Layer_hash[hash_index][i];
if ((*repeat_case).code == (*dat).code) { // 发现重复
if ((*repeat_case).layer_num == now_move_num + 1) { // 若发现的目标比现在多一层
(*(*repeat_case).adjacent).source_case.push_back(now_move_case); // 记录父节点信息
(*(*now_move_case).adjacent).next_case.push_back(repeat_case); // 记录子节点信息
for (x = 0; x < 4; x++) { // 遍历freeze表
for (y = 0; y < 5; y++) {
if ((*dat).freeze[x][y] == true) { // 将输入表合并到原先的表上
(*Layer[num][Hash[num][hash_index][k]]).freeze[x][y] = true;
(*repeat_case).freeze[x][y] = true;
}
}
}
Layer_Next[layer_num][layer_index].push_back(Hash[num][hash_index][k]); // 添加子节点数据
Layer_Source[num][Hash[num][hash_index][k]].push_back(layer_index); // 添加父节点数据
delete dat; // 释放不加入的节点
}
delete dat; // 销毁节点
return; // 退出
}
}
Hash[layer_num + 1][0xff & ((*dat).code >> 24)].push_back(Layer[layer_num + 1].size()); // 添加索引
Layer[layer_num + 1].push_back(dat); // 新增布局到Layer对应层中
Layer_Next[layer_num + 1].push_back(int_vector); // 新建子节点
Layer_Source[layer_num + 1].push_back(int_vector); // 新建父节点
Layer_Next[layer_num][layer_index].push_back(Layer[layer_num + 1].size() - 1); // 添加子节点数据
Layer_Source[layer_num + 1][Layer_Source[layer_num + 1].size() - 1].push_back(layer_index); // 添加父节点数据
(*dat).adjacent = new Case_near; // 初始化节点的相邻布局结构
(*(*dat).adjacent).source_case.push_back(now_move_case); // 记录父节点信息
(*(*now_move_case).adjacent).next_case.push_back(dat); // 记录子节点信息
(*dat).layer_num = now_move_num + 1; // 记录节点的层编号
(*dat).layer_index = Layer[now_move_num + 1].size(); // 记录节点在层中的编号
Layer[now_move_num + 1].push_back(dat); // 加入层级结构中
Layer_hash[hash_index].push_back(dat); // 加入哈希索引
}
void Find_Next_Case(Case_struct &dat_raw) { // 找到下一步移动的情况(一步可以为同一块多次移动) 结果聚集到Add_Case中
void HRD_analy::Find_Next_Case(Case_cal &dat_raw) { // 找到下一步移动的情况(一步可以为同一块多次移动) 结果聚集到Add_Case中
int num, x, y, i, j;
bool addr[4][5]; // 在Find_Sub_Case深搜中用于剪枝
Case_struct dat = dat_raw;
Case_cal dat = dat_raw;
for (y = 0; y < 5; y++) { // 仅保留空格位置的freeze为true
for (x = 0; x < 4; x++) {
if (dat.status[x][y] != 0xFE && dat.freeze[x][y] == true) { // 不为空格但freeze为true
@ -374,7 +311,7 @@ void Find_Next_Case(Case_struct &dat_raw) { // 找到下一步移动的情况(
}
}
void Find_Sub_Case(Case_struct &dat, int &num, int x, int y, bool addr[4][5]) { // 找到下一个单格移动的情况
void HRD_analy::Find_Sub_Case(Case_cal &dat, int &num, int x, int y, bool addr[4][5]) { // 找到下一个单格移动的情况
switch (dat.type[num]) {
case 0: // 2 * 2
if (y != 0) { // 不在最上面
@ -467,13 +404,13 @@ void Find_Sub_Case(Case_struct &dat, int &num, int x, int y, bool addr[4][5]) {
}
}
void Build_Case(Case_struct &dat, int &num, int x, int y, bool addr[4][5]) { // 实现移动并将结果发送到Add_Case
void HRD_analy::Build_Case(Case_cal &dat, int &num, int x, int y, bool addr[4][5]) { // 实现移动并将结果发送到Add_Case
if (addr[x][y] == true) { // 重复
return; // 退出
} else {
addr[x][y] = true; // 加入位置数据
}
Case_struct *dat_mod = new Case_struct; // 新建对象 在Add_Case中加入层中或被释放
Case_cal *dat_mod = new Case_cal; // 新建对象 在Add_Case中加入层中或被释放
*dat_mod = dat;
switch ((*dat_mod).type[num]) { // 注入移动后的信息
case 0: // 2 * 2
@ -495,7 +432,7 @@ void Build_Case(Case_struct &dat, int &num, int x, int y, bool addr[4][5]) { //
Find_Sub_Case(dat, num, x, y, addr); // 递归搜索
}
void Get_Code(Case_struct &dat) { // 获取编码并存储在dat.code 输入数据必须无误
void HRD_analy::Get_Code(Case_cal &dat) { // 获取编码并存储在dat.code 输入数据必须无误
bool temp[4][5]; // 用于临时标记
int x, y, num;
dat.code = 0;
@ -542,7 +479,7 @@ void Get_Code(Case_struct &dat) { // 获取编码并存储在dat.code 输入数
dat.code &= 0xFFFFFFFFF; // 清除高28位内容
}
bool Parse_Code(Case_struct &dat, unsigned long long Code) { // 解析编码 返回false表示编码有误
bool HRD_analy::Parse_Code(Case_cal &dat, unsigned long long Code) { // 解析编码 返回false表示编码有误
unsigned char range[16]; // dat低32位分16组
int i, x, y, num, space_num = 0;
dat.code = Code;
@ -613,7 +550,7 @@ bool Parse_Code(Case_struct &dat, unsigned long long Code) { // 解析编码 返
return true; // 20格恰好被填满
}
string Change_str(unsigned long long dat) { // 将数字转化为文本编码
string HRD_analy::Change_str(unsigned long long dat) { // 将数字转化为文本编码
string str;
str.resize(9); // 修改其长度为9位
for (int i = 8; i >= 0; i--) { // 将每一位从数值转为ASCII码
@ -627,7 +564,7 @@ string Change_str(unsigned long long dat) { // 将数字转化为文本编码
return str;
}
unsigned long long Change_int (char *str) { // 将文本编码转化为数字(传入9位字符串)
unsigned long long HRD_analy::Change_int (char *str) { // 将文本编码转化为数字(传入9位字符串)
unsigned long long dat = 0;
for (int i = 0; i < 9; i++) { // 将每一位从ASCII码转为数值
dat <<= 4;
@ -641,55 +578,3 @@ unsigned long long Change_int (char *str) { // 将文本编码转化为数字(
}
return dat;
}
void debug(Case_struct &dat) {
cout << "status" << endl;
for (int y = 0; y < 5; y++) {
for (int x = 0; x < 4; x++) {
if (dat.status[x][y] <= 9) { // 0 ~ 9
cout << int(dat.status[x][y]) << " ";
} else if (dat.status[x][y] <= 0xE) { // A ~ E
cout << char(dat.status[x][y] + 55) << " ";
} else if (dat.status[x][y] == 0xFE) { // space
cout << ". ";
} else if (dat.status[x][y] == 0xFF) { // undefined
cout << "* ";
} else { // error
cout << "! ";
}
}
cout << endl;
}
cout << "freeze" << endl;
for (int y = 0; y < 5; y++) {
for (int x = 0; x < 4; x++) {
if (dat.freeze[x][y] == true) {
cout << "x ";
} else {
cout << "- ";
}
}
cout << endl;
}
cout << "type" << endl;
for (int i = 0; i < 15; i++) {
if (i < 10) {
cout << i;
} else {
cout << char(i + 55);
}
cout << " -> ";
if (dat.type[i] == 0) {
cout << "2 * 2" << endl;
} else if (dat.type[i] == 1) {
cout << "2 * 1" << endl;
} else if (dat.type[i] == 2) {
cout << "1 * 2" << endl;
} else if (dat.type[i] == 3) {
cout << "1 * 1" << endl;
} else {
cout << "undefined" << endl;
}
}
cout << "code: " << Change_str(dat.code) << endl;
}

57
HRD_analy.h
View File

@ -0,0 +1,57 @@
#ifndef HRD_analy_H
#define HRD_analy_H
#include <vector>
#include <string>
using namespace std;
class HRD_analy {
public:
struct Case_near;
struct Case_cal {
bool freeze[4][5]; // true -> no move ; false -> can move
unsigned char status[4][5]; // 0xFF -> undefined ; 0xFE -> space
unsigned char type[15]; // 0 -> 2 * 2 ; 1 -> 2 * 1 ; 2 -> 1 * 2 ; 3 -> 1 * 1
unsigned long long code;
unsigned int layer_num;
unsigned int layer_index;
Case_near *adjacent;
};
struct Case_near {
vector <Case_cal *> source_case;
vector <Case_cal *> next_case;
};
vector <vector <Case_cal *> > Layer; // 储存全部层数据的节点
bool quiet = false; // true -> 静默模式 false -> 输出运算情况
// 布局的基本参数
int min_solution_step; // 最少的步数
int min_solution_num; // 最少步解的个数
vector <unsigned long long> min_solution_case; // 所有最少步解
vector <unsigned int> solution_step; // 所有解对应的步数
int solution_num; // 解的个数
vector <unsigned long long> solution_case; // 所有解
int farthest_step; // 最远布局的步数
int farthest_num; // 最远布局的个数
vector <unsigned long long> farthest_case; // 所有最远的布局
unsigned long long Change_int (char str[10]);
string Change_str(unsigned long long dat);
void Analyse_Case(unsigned long long code);
void Output_Detail(string File_name);
private:
vector <Case_cal *> Layer_hash[0x10000]; // 哈希表
Case_cal *now_move_case;
unsigned int now_move_num, now_move_index; // 当前扫描节点的层编号 / 当前扫描节点的层中编号
bool Parse_Code(Case_cal &dat, unsigned long long Code);
void Get_Code(Case_cal &dat);
void Find_Sub_Case(Case_cal &dat, int &num, int x, int y, bool addr[4][5]);
void Build_Case(Case_cal &dat, int &num, int x, int y, bool addr[4][5]);
void Find_Next_Case(Case_cal &dat_raw);
void Add_Case(Case_cal *dat);
void Calculate(unsigned long long code);
void Free_Data();
};
#endif
Write Preview
Loading…
Cancel
Save