#推荐

棋牌游戏开发编程入门：手把手带你撸一个房卡斗地主，核心源码全解析

// 花色: 0=黑桃, 1=红心, 2=梅花, 3=方块
// 点数: 3,4,5,6,7,8,9,10,11(J),12(Q),13(K),14(A),15(2),16(小王),17(大王)
class Card {
    constructor(suit, value) {
        this.suit = suit;   // 花色
        this.value = value; // 点数
    }
    // 用于显示
    toString() {
        const suitStr = ['♠', '♥', '♣', '♦'][this.suit];
        const valueStr = {11:'J',12:'Q',13:'K',14:'A',15:'2',16:'小王',17:'大王'}[this.value] || this.value;
        return suitStr + valueStr;
    }
}

function createDeck() {
    let deck = [];
    for (let suit = 0; suit < 4; suit++) {
        for (let value = 3; value <= 15; value++) {
            deck.push(new Card(suit, value));
        }
    }
    deck.push(new Card(0, 16)); // 小王
    deck.push(new Card(0, 17)); // 大王
    return deck;
}

function shuffle(arr) {
    for (let i = arr.length - 1; i > 0; i--) {
        const j = Math.floor(Math.random() * (i + 1));
        [arr[i], arr[j]] = [arr[j], arr[i]];
    }
    return arr;
}

function analyzeCards(cards) {
    let countMap = new Map(); // 点数 -> 张数
    cards.forEach(c => {
        countMap.set(c.value, (countMap.get(c.value) || 0) + 1);
    });
    // 转成 [张数, 点数] 的数组，方便后续分析
    let groups = [];
    for (let [value, count] of countMap) {
        groups.push({ value, count });
    }
    // 按张数从多到少，点数从大到小排序
    groups.sort((a, b) => b.count - a.count || b.value - a.value);
    return groups;
}

function getCardType(groups, length) {
    // 单张
    if (groups.length === 1 && groups[0].count === 1) return { type: 'single', weight: groups[0].value };
    // 对子
    if (groups.length === 1 && groups[0].count === 2) return { type: 'pair', weight: groups[0].value };
    // 三不带
    if (groups.length === 1 && groups[0].count === 3) return { type: 'triple', weight: groups[0].value };
    // 炸弹
    if (groups.length === 1 && groups[0].count === 4) return { type: 'bomb', weight: groups[0].value };
    // 火箭（大小王对）
    if (groups.length === 2 && groups.every(g => g.value >= 16)) return { type: 'rocket', weight: 99 };
    // 三带一
    if (groups.length === 2 && groups[0].count === 3 && groups[1].count === 1) 
        return { type: 'triple_one', weight: groups[0].value };
    // 顺子（至少5张，点数连续，且不能包含2和王）
    // ... 此处省略具体实现，思路是检查groups长度等于牌总数，且values连续
    // 等等
    return { type: 'invalid' };
}

// 服务器端简化的房间管理
const rooms = new Map(); // roomId -> room对象

function createRoom(playerId, roomConfig) {
    const roomId = generateRoomId(); // 生成6位数字房间号
    const room = {
        id: roomId,
        creator: playerId,
        players: [{ id: playerId, cards: [], ready: false }],
        maxPlayers: 3,
        state: 'waiting', // waiting / playing / finished
        deck: [],
        currentTurn: 0,
        lastPlay: null,
    };
    rooms.set(roomId, room);
    // 扣减房卡逻辑（与数据库交互）
    deductRoomCard(playerId, 1);
    return room;
}

function joinRoom(roomId, playerId) {
    const room = rooms.get(roomId);
    if (!room) return { error: '房间不存在' };
    if (room.players.length >= room.maxPlayers) return { error: '房间已满' };
    room.players.push({ id: playerId, cards: [], ready: false });
    // 广播给房间内所有人，有新玩家加入
    broadcast(room, { type: 'player_joined', playerId });
    return room;
}