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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179 | #include <chrono>
#include <fstream>
#include <functional>
#include <iostream>
#include <unordered_map>
#include <numeric>
#include <valarray>
#include <vector>
#include <boost/container_hash/hash.hpp>
#include "calsht_dw.hpp"
using Vec = std::vector<int>;
using Iter = std::vector<Vec>::iterator;
struct Key;
struct Hash;
using Keys = std::unordered_map<Key, int, Hash>;
struct Key {
Vec hand;
long long dens;
};
template <bool IsHonor>
Key make_key(const Vec& v, const long long d);
template <>
Key make_key<true>(const Vec& v, const long long d)
{
Vec tmp(v);
std::sort(tmp.begin(), tmp.end());
return Key{tmp, d};
}
template <>
Key make_key<false>(const Vec& v, const long long d)
{
Vec tmp(v);
std::reverse(tmp.begin(), tmp.end());
return Key{min(tmp, v), d};
}
struct Hash {
std::size_t operator()(const Key& key) const
{
return boost::hash_range(key.hand.begin(), key.hand.end());
}
};
bool operator==(const Key& lhs, const Key& rhs)
{
return lhs.hand == rhs.hand;
}
template <bool IsHonor>
void generate(int n, int m, Keys& keys)
{
static const Vec c = {1, 4, 6, 4, 1};
static constexpr int N = IsHonor ? 7 : 9;
static Vec hand(N);
static Vec dens(N + 1, 1);
if (n == N) {
const auto key = make_key<IsHonor>(hand, dens[n]);
if (auto itr = keys.find(key); itr == keys.end()) {
keys.emplace(key, 1);
}
else {
++itr->second;
}
}
else {
for (int i = std::max(0, m - 4 * (N - 1 - n)); i <= std::min(4, m); ++i) {
hand[n] = i;
dens[n + 1] = dens[n] * c[i];
generate<IsHonor>(n + 1, m - i, keys);
}
}
}
inline int coef(const int i, const int j, const int k)
{
if (i == j && j == k) {
return 1;
}
else if (i == j || j == k || k == i) {
return 3;
}
else {
return 6;
}
}
int count(const Vec& hand, const int64_t wait)
{
int tmp = 0;
for (int i = 0; i < K; ++i) {
if ((wait >> i) & 1) {
tmp += 4 - hand[i];
}
}
return tmp;
}
int main()
{
constexpr int M = 13;
CalshtDW calsht;
calsht.initialize("./");
const auto start = std::chrono::system_clock::now();
std::vector<Keys> keys1(M + 1);
std::vector<Keys> keys2(M + 1);
for (int m = 0; m <= M; ++m) {
generate<false>(0, m, keys1[m]);
generate<true>(0, m, keys2[m]);
}
std::valarray<long long> cnt_sht(8);
std::valarray<__int128_t> cnt_wait(8);
for (int i = 0; i <= M; ++i) {
for (int j = i; j <= M - i; ++j) {
for (int k = j; k <= M - i - j; ++k) {
std::valarray<long long> tmp_sht(8);
std::valarray<__int128_t> tmp_wait(8);
for (const auto& [key0, value0] : keys1[i]) {
for (const auto& [key1, value1] : keys1[j]) {
for (const auto& [key2, value2] : keys1[k]) {
for (const auto& [key3, value3] : keys2[M - i - j - k]) {
Vec hand(K);
std::copy(key0.hand.begin(), key0.hand.end(), hand.begin());
std::copy(key1.hand.begin(), key1.hand.end(), hand.begin() + 9);
std::copy(key2.hand.begin(), key2.hand.end(), hand.begin() + 18);
std::copy(key3.hand.begin(), key3.hand.end(), hand.begin() + 27);
const auto [sht, mode, disc, wait] = calsht(hand, M / 3, 7);
const auto dens = key0.dens * value0 * key1.dens * value1 * key2.dens * value2 * key3.dens * value3;
tmp_sht[sht] += dens;
tmp_wait[sht] += count(hand, wait) * dens;
}
}
}
}
cnt_sht += tmp_sht * coef(i, j, k);
cnt_wait += tmp_wait * coef(i, j, k);
}
}
}
const auto end = std::chrono::system_clock::now();
const auto total = cnt_sht.sum();
double ev = 0.0;
std::cout << "Shanten\tCount\tProp\tAvg Wait" << std::endl;
for (int i = 0; i < 8; ++i) {
ev += (i - 1) * cnt_sht[i];
std::cout << i - 1 << "\t" << cnt_sht[i] << "\t"
<< static_cast<double>(cnt_sht[i]) / total << "\t"
<< static_cast<double>(cnt_wait[i]) / cnt_sht[i] << std::endl;
}
std::cout << "Number of Tiles: " << M << std::endl;
std::cout << "Total: " << total << std::endl;
std::cout << "Time (msec.): " << std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count() << std::endl;
std::cout << "Avg Shanten: " << ev / total << std::endl;
std::cout << "Avg Wait: " << static_cast<double>(cnt_wait.sum()) / total << std::endl;
return 0;
}
|