Table of Contents
How to implement the big and small competitions of the Zhajinhua game with PHP, php golden flower
Home Backend Development PHP Tutorial PHP method to realize the big and small competitions of Zha Jinhua game, php Jinhua_PHP tutorial

PHP method to realize the big and small competitions of Zha Jinhua game, php Jinhua_PHP tutorial

Jul 13, 2016 am 10:04 AM
php method game

How to implement the big and small competitions of the Zhajinhua game with PHP, php golden flower

This article describes the example of the method of realizing the big and small competitions of the Zhajinhua game with PHP. Share it with everyone for your reference. The specific analysis is as follows:

Programs are inseparable from algorithms. The pathfinding algorithm was discussed earlier. However, in the example diagram at that time, the optional path was the only one. When we choose an algorithm, we mean to choose this unique path. How to choose it?

I still remember that when I was in junior high school, I would often hide on the side of the road after school in the afternoon to make gold flowers and gamble* money. It seemed that I was addicted to it. Now during the Chinese New Year, we often make gold flowers and gamble* money together, but my luck is not good. I lose every time.

The sun is shining brightly today. I just went out to play during Qingming Festival, so I didn’t go anywhere today. When I had nothing to do, I thought about how to use a program to compare the sizes of two cards in Golden Flower. Now that I have implemented it, some methods are quite important, so I wrote them down.

Okay, no more nonsense.

I won’t go into the rules for comparing the two decks of cards in Zhajinhua. Please indicate when it is a straight: JQK < A23 < QKA

Idea: tie golden flowers

1. Randomly generate two decks of cards, and the structure of each deck is
Copy code The code is as follows: array(
array('Spade','K'),
array('Club','6'),
array('Spade','J'),
)
Copy code The code is as follows: array(
array('Spade','K'),
array('Club','6'),
array('Spade','J'),
)

2. Calculate the score of each deck of cards: each deck of cards has an original size (that is, excluding pairs, straights, golden flowers, straight golds, and bobbins), and then

The score of each card is a 2-digit number. If there are less than 2 digits, leading 0s are added, for example, 'A': 14, '10': 10, '2': '02', 'k': 13, '7': 07

Sort the 3 cards according to the number of points (from large to small) to form a 6-digit number. For example 'A27': 140702, '829': 090802, 'JK8': 131108, '2A10': 141002

Exception, for pairs, put the digits of the pair in the first two digits (you will see why we do this later). For example '779': 070709, '7A7': 070714, 'A33': 030314

The current score is a 6-digit number, and the pair is set to an original value plus 10*100000, which is now a 7-digit number. For example '779': 1070709, '7A7': 1070714, 'A33': 1030314

For a straight, add 20*100000 to the result. For example '345': 2050403, 'QKA': 2141312, '23A': 2140302

For Golden Flower, add 30*100000 to the result. For example 'Spade K,Spade 6,Spade J': 3131106

Because the straight gold is actually the sum of the golden flower and the straight child, so the straight gold should be 50*10000. For example 'Spade 7,Spade 6,Spade 8': 5080706

For the bobbin, add 60*100000 to the result. For example '666': 6060606, 'JJJ': 6111111

3. Compare the sizes of the two cards (use the calculated scores to compare)

It’s that simple! !

代码如下(PHP)
复制代码 代码如下: class PlayCards 

    public $suits = array('Spade', 'Heart', 'Diamond', 'Club'); 
    public $figures = array('2', '3', '4', '5', '6', '7', '8', '9', '10', 'J', 'Q', 'K', 'A'); 
    public $cards = array(); 
    public function __construct() 
    { 
        $cards = array(); 
        foreach($this->suits as $suit){ 
            foreach($this->figures as $figure){ 
                $cards[] = array($suit,$figure); 
            } 
        } 
        $this->cards = $cards; 
    } 
    public function getCard() 
    { 
        shuffle($this->cards); 
        //生成3张牌 
        return array(array_pop($this->cards), array_pop($this->cards), array_pop($this->cards));    
    } 
    public function compareCards($card1,$card2) 
    { 
        $score1 = $this->ownScore($card1); 
        $score2 = $this->ownScore($card2); 
        if($score1 > $score2) return 1; 
        elseif($score1 < $score2) return -1; 
        return 0;        
    } 
    private function ownScore($card) 
    { 
        $suit = $figure = array(); 
        foreach($card as $v){ 
            $suit[] = $v[0]; 
            $figure[] = array_search($v[1],$this->figures)+2; 
        } 
        //补齐前导0 
        for($i = 0; $i < 3; $i++){ 
            $figure[$i] = str_pad($figure[$i],2,'0',STR_PAD_LEFT); 
        } 
        rsort($figure); 
        //对于对子做特殊处理 
        if($figure[1] == $figure[2]){ 
            $temp = $figure[0]; 
            $figure[0] = $figure[2]; 
            $figure[2] = $temp; 
        } 
        $score = $figure[0].$figure[1].$figure[2]; 
        //筒子 60*100000 
        if($figure[0] == $figure[1] && $figure[0] == $figure[2]){ 
            $score += 60*100000; 
        } 
        //金花 30*100000 
        if($suit[0] == $suit[1] && $suit[0] == $suit[2]){ 
            $score += 30*100000; 
        } 
        //顺子 20*100000 
        if($figure[0] == $figure[1]+1 && $figure[1] == $figure[2]+1 || implode($figure) =='140302'){ 
            $score += 20*100000; 
        } 
        //对子 10*100000 
        if($figure[0] == $figure[1] && $figure[1] != $figure[2]){ 
 
            $score += 10*100000; 
        } 
        return $score; 
    } 

 
//test 
$playCard = new PlayCards(); 
$card1 = $playCard->getCard(); 
$card2 = $playCard->getCard(); 
$result = $playCard->compareCards($card1,$card2); 

echo 'card1 is ',printCard($card1),'
'; 
echo 'card2 is ',printCard($card2),'
'; 
$str = 'card1 equit card2'; 
if($result == 1) $str =  'card1 is larger than card2'; 
elseif($result == -1) $str = 'card1 is smaller than card2'; 
echo $str; 
function printCard($card) 

    $str = '('; 
    foreach($card as $v){ 
        $str .= $v[0].$v[1].','; 
    } 
    return trim($str,',').')'; 
}
复制代码 代码如下: class PlayCards 

    public $suits = array('Spade', 'Heart', 'Diamond', 'Club'); 
    public $figures = array('2', '3', '4', '5', '6', '7', '8', '9', '10', 'J', 'Q', 'K', 'A'); 
    public $cards = array(); 
    public function __construct() 
    { 
        $cards = array(); 
        foreach($this->suits as $suit){ 
            foreach($this->figures as $figure){ 
                $cards[] = array($suit,$figure); 
            } 
        } 
        $this->cards = $cards; 
    } 
    public function getCard() 
    { 
        shuffle($this->cards); 
        //生成3张牌 
        return array(array_pop($this->cards), array_pop($this->cards), array_pop($this->cards));    
    } 
    public function compareCards($card1,$card2) 
    { 
        $score1 = $this->ownScore($card1); 
        $score2 = $this->ownScore($card2); 
        if($score1 > $score2) return 1; 
        elseif($score1 < $score2) return -1; 
        return 0;        
    } 
    private function ownScore($card) 
    { 
        $suit = $figure = array(); 
        foreach($card as $v){ 
            $suit[] = $v[0]; 
            $figure[] = array_search($v[1],$this->figures)+2; 
        } 
        //补齐前导0 
        for($i = 0; $i < 3; $i++){ 
            $figure[$i] = str_pad($figure[$i],2,'0',STR_PAD_LEFT); 
        } 
        rsort($figure); 
        //对于对子做特殊处理 
        if($figure[1] == $figure[2]){ 
            $temp = $figure[0]; 
            $figure[0] = $figure[2]; 
            $figure[2] = $temp; 
        } 
        $score = $figure[0].$figure[1].$figure[2]; 
        //筒子 60*100000 
        if($figure[0] == $figure[1] && $figure[0] == $figure[2]){ 
            $score += 60*100000; 
        } 
//金花 30*100000
if($suit[0] == $suit[1] && $suit[0] == $suit[2]){
$score += 30*100000;
}
//顺子 20*100000
if($figure[0] == $figure[1]+1 && $figure[1] == $figure[2]+1 || implode($figure) =='140302'){
$score += 20*100000;
}
        //对子 10*100000 
        if($figure[0] == $figure[1] && $figure[1] != $figure[2]){ 
 
            $score += 10*100000; 
        } 
        return $score; 
    } 

 
//test 
$playCard = new PlayCards(); 
$card1 = $playCard->getCard(); 
$card2 = $playCard->getCard(); 
$result = $playCard->compareCards($card1,$card2); 

echo 'card1 is ',printCard($card1),'
'; 
echo 'card2 is ',printCard($card2),'
'; 
$str = 'card1 equit card2'; 
if($result == 1) $str =  'card1 is larger than card2'; 
elseif($result == -1) $str = 'card1 is smaller than card2'; 
echo $str; 

function printCard($card) 

    $str = '('; 
    foreach($card as $v){ 
        $str .= $v[0].$v[1].','; 
    } 
    return trim($str,',').')'; 
}

希望本文所述对大家的php程序设计有所帮助。

www.bkjia.comtruehttp://www.bkjia.com/PHPjc/965567.htmlTechArticlePHP实现扎金花游戏之大小比赛的方法,php金花 本文实例讲述了PHP实现扎金花游戏之大小比赛的方法。分享给大家供大家参考。具体分析如下...
Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn

Hot AI Tools

Undresser.AI Undress

Undresser.AI Undress

AI-powered app for creating realistic nude photos

AI Clothes Remover

AI Clothes Remover

Online AI tool for removing clothes from photos.

Undress AI Tool

Undress AI Tool

Undress images for free

Clothoff.io

Clothoff.io

AI clothes remover

Video Face Swap

Video Face Swap

Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Tools

Notepad++7.3.1

Notepad++7.3.1

Easy-to-use and free code editor

SublimeText3 Chinese version

SublimeText3 Chinese version

Chinese version, very easy to use

Zend Studio 13.0.1

Zend Studio 13.0.1

Powerful PHP integrated development environment

Dreamweaver CS6

Dreamweaver CS6

Visual web development tools

SublimeText3 Mac version

SublimeText3 Mac version

God-level code editing software (SublimeText3)

PHP 8.4 Installation and Upgrade guide for Ubuntu and Debian PHP 8.4 Installation and Upgrade guide for Ubuntu and Debian Dec 24, 2024 pm 04:42 PM

PHP 8.4 brings several new features, security improvements, and performance improvements with healthy amounts of feature deprecations and removals. This guide explains how to install PHP 8.4 or upgrade to PHP 8.4 on Ubuntu, Debian, or their derivati

7 PHP Functions I Regret I Didn't Know Before 7 PHP Functions I Regret I Didn't Know Before Nov 13, 2024 am 09:42 AM

If you are an experienced PHP developer, you might have the feeling that you’ve been there and done that already.You have developed a significant number of applications, debugged millions of lines of code, and tweaked a bunch of scripts to achieve op

How To Set Up Visual Studio Code (VS Code) for PHP Development How To Set Up Visual Studio Code (VS Code) for PHP Development Dec 20, 2024 am 11:31 AM

Visual Studio Code, also known as VS Code, is a free source code editor — or integrated development environment (IDE) — available for all major operating systems. With a large collection of extensions for many programming languages, VS Code can be c

How do you parse and process HTML/XML in PHP? How do you parse and process HTML/XML in PHP? Feb 07, 2025 am 11:57 AM

This tutorial demonstrates how to efficiently process XML documents using PHP. XML (eXtensible Markup Language) is a versatile text-based markup language designed for both human readability and machine parsing. It's commonly used for data storage an

Explain JSON Web Tokens (JWT) and their use case in PHP APIs. Explain JSON Web Tokens (JWT) and their use case in PHP APIs. Apr 05, 2025 am 12:04 AM

JWT is an open standard based on JSON, used to securely transmit information between parties, mainly for identity authentication and information exchange. 1. JWT consists of three parts: Header, Payload and Signature. 2. The working principle of JWT includes three steps: generating JWT, verifying JWT and parsing Payload. 3. When using JWT for authentication in PHP, JWT can be generated and verified, and user role and permission information can be included in advanced usage. 4. Common errors include signature verification failure, token expiration, and payload oversized. Debugging skills include using debugging tools and logging. 5. Performance optimization and best practices include using appropriate signature algorithms, setting validity periods reasonably,

PHP Program to Count Vowels in a String PHP Program to Count Vowels in a String Feb 07, 2025 pm 12:12 PM

A string is a sequence of characters, including letters, numbers, and symbols. This tutorial will learn how to calculate the number of vowels in a given string in PHP using different methods. The vowels in English are a, e, i, o, u, and they can be uppercase or lowercase. What is a vowel? Vowels are alphabetic characters that represent a specific pronunciation. There are five vowels in English, including uppercase and lowercase: a, e, i, o, u Example 1 Input: String = "Tutorialspoint" Output: 6 explain The vowels in the string "Tutorialspoint" are u, o, i, a, o, i. There are 6 yuan in total

Explain late static binding in PHP (static::). Explain late static binding in PHP (static::). Apr 03, 2025 am 12:04 AM

Static binding (static::) implements late static binding (LSB) in PHP, allowing calling classes to be referenced in static contexts rather than defining classes. 1) The parsing process is performed at runtime, 2) Look up the call class in the inheritance relationship, 3) It may bring performance overhead.

What are PHP magic methods (__construct, __destruct, __call, __get, __set, etc.) and provide use cases? What are PHP magic methods (__construct, __destruct, __call, __get, __set, etc.) and provide use cases? Apr 03, 2025 am 12:03 AM

What are the magic methods of PHP? PHP's magic methods include: 1.\_\_construct, used to initialize objects; 2.\_\_destruct, used to clean up resources; 3.\_\_call, handle non-existent method calls; 4.\_\_get, implement dynamic attribute access; 5.\_\_set, implement dynamic attribute settings. These methods are automatically called in certain situations, improving code flexibility and efficiency.

See all articles