/*
1.查表法计算麻将胡牌(原理:http://hp.vector.co.jp/authors/VA046927/mjscore/mjalgorism.html)
2.跟拆解法对比进行效率比较
*/
package main
import (
"fmt"
"time"
"sort"
"os"
"encoding/json"
"log"
"runtime/debug"
"io/ioutil"
"io"
"math/rand"
)
type jsonData struct {
K int
V int
}
var g_cards = []int {
0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, /* 筒 */
0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19, /* 条 */
0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28, 0x29, /* 万 */
0x31, 0x41, 0x51, 0x61, 0x71, 0x81, 0x91, /* 东南西北中发白 */
}
func value2index(value int) int {
if value < 0x31 {
return ((value&0xF0)>>4)*9 + (value&0x0F) - 1
} else {
return 27 + ((value&0xF0)>>4) - 3
}
}
func count(cards []int) []int {
nums := make([]int, 34)
for _, v := range cards {
nums[value2index(v)]++
}
return nums
}
func calcKey(nums []int) int {
p := -1
x := 0
b := false
for i := 0; i < 3; i++ {
for j := 0; j < 9; j++ {
if (nums[i * 9 + j] == 0) {
if (b) {
b = false
x |= 0x1 << uint32(p)
p++
}
} else {
p++
b = true
switch (nums[i * 9 + j]) {
case 2:
x |= 0x3 << uint32(p)
p += 2
case 3:
x |= 0xF << uint32(p)
p += 4
case 4:
x |= 0x3F << uint32(p)
p += 6
}
}
}
if (b) {
b = false
x |= 0x1 << uint32(p)
p++
}
}
dong := value2index(0x31)
bai := value2index(0x91)
// 字牌
for i := dong; i <= bai; i++ {
if (nums[i] > 0) {
p++
switch (nums[i]) {
case 2:
x |= 0x3 << uint32(p)
p += 2
case 3:
x |= 0xF << uint32(p)
p += 4
case 4:
x |= 0x3F << uint32(p)
p += 6
}
x |= 0x1 << uint32(p)
p++
}
}
return x
}
/* 可以是这种牌型11 111,虽然1不可能有5张,但是可以胡1的.且最多有一种牌是5张牌的组合 */
func checkIsValid(nums []int) bool {
if (len(nums)%3 != 2) {
return false
}
n := 0
for _, v := range nums {
if v > 5 {
return false
}
if v == 5 {
n++
}
}
if n > 1 {
return false
}
return true
}
func getCardsNum(nums []int) int {
cardsNum := 0
for _, v := r
麻将胡牌算法(查表法 和 拆解法)
最新推荐文章于 2021-02-10 01:14:11 发布
本文对比了麻将胡牌算法的两种方法:查表法和拆解法。查表法虽然需要预先生成表,但在计算胡牌时效率较高且稳定;而拆解法虽然无需预生成表,但不同牌型的计算时间可能相差较大,稳定性较低。
摘要由CSDN通过智能技术生成