How to solve Sudoku in PHP? This article mainly introduces the Sudoku solving problem implemented in PHP, involving the traversal, comparison, judgment, operation and other related operation skills of PHP arrays and strings. Friends in need can refer to it. I hope to be helpful.
The details are as follows:
1. Sudoku problem description:
For the given two-dimensional array of numbers, the numbers in each row and column are required Cannot be repeated.
2. Implementation code:
<?php /* 数独求解程序 * */ class Sudoku { var $matrix; function __construct($arr = null) { if ($arr == null) { $this->clear(); } else { $this->matrix = $arr; } } function clear() { for($i=0; $i<9; $i++) { for($j=0; $j<9; $j++) { $this->matrix[$i][$j] = array(); for ($k = 1; $k <= 9; $k++) { $this->matrix[$i][$j][$k] = $k; } } } } function setCell($row, $col, $value){ $this->matrix[$row][$col] = array($value => $value); //row for($i = 0; $i < 9; $i++){ if($i != $col){ if(! $this->removeValue($row, $i, $value)) { return false; } } } //col for($i = 0; $i < 9; $i++){ if($i != $row){ if(! $this->removeValue($i, $col, $value)) { return false; } } } //square $rs=intval($row / 3) * 3; $cs=intval($col / 3) * 3; for($i = $rs; $i < $rs + 3; $i++){ for($j = $cs; $j < $cs + 3; $j++){ if($i != $row && $j != $col){ if(! $this->removeValue($i, $j, $value)) return false; } } } return true; } function removeValue($row, $col, $value) { $count = count($this->matrix[$row][$col]); if($count == 1){ $ret = !isset($this->matrix[$row][$col][$value]); return $ret; } if (isset($this->matrix[$row][$col][$value])) { unset($this->matrix[$row][$col][$value]); if($count - 1 == 1) { return $this->setCell($row, $col, current($this->matrix[$row][$col])); } } return true; } function set($arr) { for ($i = 0; $i < 9; $i++) { for ($j = 0; $j < 9; $j++) { if ($arr[$i][$j] > 0) { $this->setCell($i, $j, $arr[$i][$j]); } } } } function dump() { for($i = 0; $i < 9; $i++){ for($j = 0; $j < 9; $j++){ $c = count($this->matrix[$i][$j]); if($c == 1){ echo " ".current($this->matrix[$i][$j])." "; } else { echo "(".$c.")"; } } echo "\n"; } echo "\n"; } function dumpAll() { for($i = 0; $i < 9; $i++){ for($j = 0; $j < 9; $j++){ echo implode('', $this->matrix[$i][$j]), "\t"; } echo "\n"; } echo "\n"; } function calc($data) { $this->clear(); $this->set($data); $this->_calc(); $this->dump(); } function _calc() { for($i = 0; $i < 9; $i++){ for($j = 0; $j < 9; $j++){ if(count($this->matrix[$i][$j]) == 1) { continue; } foreach($this->matrix[$i][$j] as $v){ $flag = false; $t = new Sudoku($this->matrix); if(!$t->setCell($i, $j, $v)){ continue; } if(!$t->_calc()){ continue; } $this->matrix = $t->matrix; return true; } return false; } } return true; } } $sd=new Sudoku; $sd->calc(array( array(0,5,0,0,0,6,0,9,0), array(0,4,7,0,8,2,6,0,0), array(0,8,0,0,0,7,0,5,2), array(7,0,1,0,3,4,0,0,6), array(0,3,0,0,2,0,0,8,0), array(2,0,0,0,0,1,9,0,4), array(4,7,0,1,0,0,0,6,0), array(0,0,9,4,6,0,3,7,0), array(0,1,0,2,0,0,0,4,0), )); $sd->calc(array( array(1,0,0,0,0,6,9,0,0), array(0,0,0,9,0,0,0,0,5), array(2,0,0,1,0,0,0,0,3), array(0,0,5,3,0,7,0,2,0), array(3,0,0,6,0,0,0,0,1), array(0,1,0,4,0,0,8,0,0), array(9,0,0,0,0,2,0,0,7), array(5,0,0,0,0,9,0,0,0), array(0,0,3,7,0,0,0,0,4), )); $sd->calc(array( array(7,0,0,1,0,0,0,0,5), array(0,0,6,0,4,0,0,8,0), array(0,0,1,0,0,0,0,0,0), array(0,6,0,0,8,0,0,0,3), array(0,8,0,0,0,9,0,7,0), array(1,0,0,0,0,0,0,5,0), array(0,0,0,0,0,0,9,0,0), array(0,4,0,0,3,0,1,0,0), array(9,0,0,0,0,7,0,0,2), )); $sd->calc(array( array(0,5,0,0,0,0,0,2,0), array(0,0,3,1,0,0,5,0,0), array(0,0,6,0,0,8,0,0,0), array(6,0,0,0,0,0,0,1,0), array(8,0,0,6,0,0,0,0,4), array(0,3,0,0,0,9,0,0,7), array(0,0,0,5,0,0,3,0,0), array(0,0,8,0,0,6,9,0,0), array(0,9,0,0,0,0,0,7,0), )); ?>
The running results are as follows:
1 5 2 3 4 6 7 9 8 9 4 7 5 8 2 6 1 3 3 8 6 9 1 7 4 5 2 7 9 1 8 3 4 5 2 6 5 3 4 6 2 9 1 8 7 2 6 8 7 5 1 9 3 4 4 7 3 1 9 8 2 6 5 8 2 9 4 6 5 3 7 1 6 1 5 2 7 3 8 4 9 1 3 7 2 5 6 9 4 8 4 6 8 9 7 3 2 1 5 2 5 9 1 8 4 6 7 3 6 8 5 3 1 7 4 2 9 3 9 4 6 2 8 7 5 1 7 1 2 4 9 5 8 3 6 9 4 6 5 3 2 1 8 7 5 7 1 8 4 9 3 6 2 8 2 3 7 6 1 5 9 4 7 3 8 1 9 6 4 2 5 2 9 6 3 4 5 7 8 1 4 5 1 2 7 8 3 9 6 5 6 9 7 8 4 2 1 3 3 8 2 5 1 9 6 7 4 1 7 4 6 2 3 8 5 9 6 2 7 4 5 1 9 3 8 8 4 5 9 3 2 1 6 7 9 1 3 8 6 7 5 4 2 9 5 1 3 6 7 4 2 8 7 8 3 1 4 2 5 6 9 2 4 6 9 5 8 7 3 1 6 2 9 4 7 5 8 1 3 8 7 5 6 1 3 2 9 4 1 3 4 2 8 9 6 5 7 4 6 7 5 9 1 3 8 2 3 1 8 7 2 6 9 4 5 5 9 2 8 3 4 1 7 6
Related recommendations:
Some introduction to PHP array functions
PHP array traversal foreach syntax structure and examples
php array processing function extract detailed explanation and example code
The above is the detailed content of Detailed explanation of how to solve Sudoku in PHP. For more information, please follow other related articles on the PHP Chinese website!

ThesecrettokeepingaPHP-poweredwebsiterunningsmoothlyunderheavyloadinvolvesseveralkeystrategies:1)ImplementopcodecachingwithOPcachetoreducescriptexecutiontime,2)UsedatabasequerycachingwithRedistolessendatabaseload,3)LeverageCDNslikeCloudflareforservin

You should care about DependencyInjection(DI) because it makes your code clearer and easier to maintain. 1) DI makes it more modular by decoupling classes, 2) improves the convenience of testing and code flexibility, 3) Use DI containers to manage complex dependencies, but pay attention to performance impact and circular dependencies, 4) The best practice is to rely on abstract interfaces to achieve loose coupling.

Yes,optimizingaPHPapplicationispossibleandessential.1)ImplementcachingusingAPCutoreducedatabaseload.2)Optimizedatabaseswithindexing,efficientqueries,andconnectionpooling.3)Enhancecodewithbuilt-infunctions,avoidingglobalvariables,andusingopcodecaching

ThekeystrategiestosignificantlyboostPHPapplicationperformanceare:1)UseopcodecachinglikeOPcachetoreduceexecutiontime,2)Optimizedatabaseinteractionswithpreparedstatementsandproperindexing,3)ConfigurewebserverslikeNginxwithPHP-FPMforbetterperformance,4)

APHPDependencyInjectionContainerisatoolthatmanagesclassdependencies,enhancingcodemodularity,testability,andmaintainability.Itactsasacentralhubforcreatingandinjectingdependencies,thusreducingtightcouplingandeasingunittesting.

Select DependencyInjection (DI) for large applications, ServiceLocator is suitable for small projects or prototypes. 1) DI improves the testability and modularity of the code through constructor injection. 2) ServiceLocator obtains services through center registration, which is convenient but may lead to an increase in code coupling.

PHPapplicationscanbeoptimizedforspeedandefficiencyby:1)enablingopcacheinphp.ini,2)usingpreparedstatementswithPDOfordatabasequeries,3)replacingloopswitharray_filterandarray_mapfordataprocessing,4)configuringNginxasareverseproxy,5)implementingcachingwi

PHPemailvalidationinvolvesthreesteps:1)Formatvalidationusingregularexpressionstochecktheemailformat;2)DNSvalidationtoensurethedomainhasavalidMXrecord;3)SMTPvalidation,themostthoroughmethod,whichchecksifthemailboxexistsbyconnectingtotheSMTPserver.Impl


Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

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

Hot Article

Hot Tools

mPDF
mPDF is a PHP library that can generate PDF files from UTF-8 encoded HTML. The original author, Ian Back, wrote mPDF to output PDF files "on the fly" from his website and handle different languages. It is slower than original scripts like HTML2FPDF and produces larger files when using Unicode fonts, but supports CSS styles etc. and has a lot of enhancements. Supports almost all languages, including RTL (Arabic and Hebrew) and CJK (Chinese, Japanese and Korean). Supports nested block-level elements (such as P, DIV),

SublimeText3 Chinese version
Chinese version, very easy to use

WebStorm Mac version
Useful JavaScript development tools

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver Mac version
Visual web development tools
