Showing source for: https://www.dcode.fr/sudoku-solver
Duration: 0.121986s
Server: cloudflare
<!DOCTYPE html>
<html lang="en" prefix="og: https://ogp.me/ns#">
<head>
<title>Sudoku Solver - with Step by Step - Online Resolver</title>
<meta charset="UTF-8">
<meta property="og:title" content="Sudoku Solver - with Step by Step - Online Resolver" />
<meta property="og:description" content="Tool/Solver to resolve sudoku/wordoku grids (directly or step by step). The aim of the sudoku game is to fill the rows and columns of a 9x9 grid with each digit only once." />
<meta property="og:type" content="website" />
<meta property="og:url" content="https://www.dcode.fr/sudoku-solver" />
<meta property="og:image" content="https://www.dcode.fr/images/dcode.png" />
<meta name="twitter:card" content="summary" />
<meta name="twitter:site" content="@dCode_fr" />
<meta name="twitter:title" content="Sudoku Solver" />
<meta name="twitter:description" content="Tool/Solver to resolve sudoku/wordoku grids (directly or step by step). The aim of the sudoku game is to fill the rows and columns of a 9x9 grid with each digit only once." />
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
<meta name="description" content="Tool/Solver to resolve sudoku/wordoku grids (directly or step by step). The aim of the sudoku game is to fill the rows and columns of a 9x9 grid with each digit only once." />
<meta name="keywords" content="sudoku,grid,9x9,row,column,block" />
<link rel="canonical" href="https://www.dcode.fr/sudoku-solver" />
<link rel="alternate" href="https://www.dcode.fr/solveur-sudoku" hreflang="fr" /><link rel="alternate" href="https://www.dcode.fr/solucionador-sudoku" hreflang="es" />
<link href="https://www.dcode.fr/static/dcode3.110.css" rel="stylesheet" type="text/css" />
<link rel="search" type="application/opensearchdescription+xml" title="dCode" href="opensearch.xml" />
<link rel="preconnect" href="https://securepubads.g.doubleclick.net">
<link rel="preconnect" href="https://googleads.g.doubleclick.net/">
<link rel="icon" type="image/png" href="favicon.ico" />
<link rel="apple-touch-icon-precomposed" href="favicon.ico" />
<meta name="msapplication-TileColor" content="#f8efd3" />
<meta name="msapplication-TileImage" content="favicon.ico" />
<meta name="theme-color" content="#ECE2C3">
</head>
<body id="sudoku-solver" lang="en" data-title="Sudoku Solver" data-url="https://www.dcode.fr/sudoku-solver">
<!--body -->
<div id="body">
<!-- top -->
<div id="top">
<!-- left -->
<div id="left">
<!-- logo -->
<div id="logo">
<a href="https://www.dcode.fr/en" title="dCode"><img src="https://www.dcode.fr/images/dcode.png" alt="dCode" width="265" height="137" /></a>
</div>
<!-- !logo -->
<!-- search -->
<div class="heading_bar">Search for a tool</div>
<form id="search" action="#">
<label for="search_input">🔎︎ Search a tool on dCode</label><br />
<input type="search" id="search_input" placeholder="e.g. type 'boolean'" value="" /> <button>⏎</button><br />
<label>Browse the <a href='tools-list'>full dCode tools' list</a></label><br />
</form>
<div id="search_results"></div>
<!-- !search -->
<!-- overview -->
<div class="heading_bar" id="title_left">Sudoku Solver</div>
<p id="overview">Tool/Solver to resolve sudoku/wordoku grids (directly or step by step). The aim of the sudoku game is to fill the rows and columns of a 9x9 grid with each digit only once.</p>
<!-- results -->
<div class="heading_bar"><span id="results_title">Results</span><span id="results_icons"></span></div>
<div id="results" translate="no" class="notranslate"></div>
<!-- !results -->
<!-- float_left -->
<div id="float_left">
<div><div id='div-gpt-ad-1407836252997-0' style='min-width:336px;min-height:280px'></div></div>
<!-- webap -->
<div id="webap" itemscope itemtype="http://schema.org/WebApplication">
<meta itemprop="browserRequirements" content="HTML5, Javascript" />
<meta itemprop="inLanguage" content="en" />
<meta itemprop="url" content="https://www.dcode.fr/sudoku-solver" />
<meta itemprop="operatingSystem" content="all" />
<p><span itemprop="name">Sudoku Solver</span> - <span itemprop="author" itemscope itemtype="http://schema.org/Organization"><a itemprop="url" href="https://www.dcode.fr/"><span itemprop="name">dCode</span></a></span></p>
<p>Tag(s) : <span itemprop="applicationCategory">Number Games</span></p>
</div>
<!-- !webap -->
<!-- share -->
<div class="heading_bar">Share</div>
<div id="share">
<img src="https://www.dcode.fr/images/share.png" width="177" height="34" alt="Share" loading="lazy" />
</div>
<!-- !share -->
<!-- contact -->
<div class="heading_bar">dCode and more</div>
<p class="contact">dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!<br/>A suggestion ? a feedback ? a bug ? an idea ? <em>Write to dCode</em>!</p>
<div id="contact" title="dCode and more">
<form id="contact_form" action="#">
<label>Need Help ?</label><br/>
<p>Please, check our <a href='https://discord.gg/bKdbZeP' target='_blank' rel='noopener'>dCode Discord</a> community for help requests!<br>NB: for encrypted messages, test our automatic <a href='/cipher-identifier'>cipher identifier</a>!<br/><br/></p>
<label for="contact_message">Message for dCode's team:</label><br/>
<textarea id="contact_message" placeholder="A feedback, a feature request, a question, an opinion to share? (Help requests are ignored)
NB : to get an answer, leave an email address (not published)"></textarea>
<button>Send this message!</button>
<p>Feedback and suggestions are welcome so that dCode offers the best 'Sudoku Solver' tool for free! Thank you!</p>
</form>
</div>
<!-- !contact -->
</div>
<!-- !float_left -->
</div>
<!-- !left -->
</div>
<!-- !top -->
<!-- center -->
<div id="center">
<h1 id="title">Sudoku Solver</h1>
<div id="breadcrumps"><ol itemscope itemtype="http://schema.org/BreadcrumbList"><li itemprop="itemListElement" itemscope itemtype="http://schema.org/ListItem"><a itemprop="item" href="https://www.dcode.fr/tools-list#solver"><span itemprop="name">Games and Solvers</span></a><meta itemprop="position" content="1" /></li><li itemprop="itemListElement" itemscope itemtype="http://schema.org/ListItem"><a itemprop="item" href="https://www.dcode.fr/tools-list#number_game"><span itemprop="name">Number Games</span></a><meta itemprop="position" content="2" /></li><li itemprop="itemListElement" itemscope itemtype="http://schema.org/ListItem"><a itemprop="item" href="https://www.dcode.fr/sudoku-solver"><span itemprop="name">Sudoku Solver</span></a><meta itemprop="position" content="3" /></li></ol></div>
<!-- advert -->
<div id='div-gpt-ad-1407836191040-0' style='min-width:320px;min-height:100px'></div>
<!-- !advert -->
<div id="forms">
<h2 class="h2_form" id="f0">Solve a sudoku grid</h2>
<form id="sudoku_solver" method="post">
<label class="">9x9 Sudoku Grid (digits or letters)</label><br />
<div id="sudoku_solver_sudoku" data-name="sudoku">Loading...<br/><small>(if this message do not disappear, try to refresh this page)</small></div>
<table><tbody><tr><td valign="top"><label id="sudoku_solver_mode">Resolution</label></td><td role="radiogroup" aria-labelledby="sudoku_solver_mode"><label class="nostar" for="sudoku_solver_mode_1"><input type="radio" id="sudoku_solver_mode_1" name="mode" value="1" checked> Find a solution</label><br/><label class="nostar" for="sudoku_solver_mode_all"><input type="radio" id="sudoku_solver_mode_all" name="mode" value="all" > Compute all solutions</label><br/><label class="nostar" for="sudoku_solver_mode_steps"><input type="radio" id="sudoku_solver_mode_steps" name="mode" value="steps" > Step by Step Solution</label><br/></td></tr></tbody></table>
<label for="sudoku_solver_diagonal">Mode Sudoku X (Diagonals are also blocks) <input type="checkbox" id="sudoku_solver_diagonal" name="diagonal" /></label><br/>
<label for="sudoku_solver_hypersudoku">Mode HyperSudoku (Add 4 interior blocks ⊞) <input type="checkbox" id="sudoku_solver_hypersudoku" name="hypersudoku" /></label><br/>
<label for="sudoku_solver_center_plus">Mode Plus (Add 1 block âž• in the center) <input type="checkbox" id="sudoku_solver_center_plus" name="center_plus" /></label><br/>
<label for="sudoku_solver_center_dots">Mode Dots (Add 1 block ⋮⋮⋮ made with the centers) <input type="checkbox" id="sudoku_solver_center_dots" name="center_dots" /></label><br/>
<button data-post="sudoku,mode,diagonal,hypersudoku,center_plus,center_dots" post="sudoku,mode,diagonal,hypersudoku,center_plus,center_dots">Solve</button>
<div class="cf "><span>See also:</span> <a href="/irregular-sudoku-solver">Irregular NxN Sudoku Solver</a> — <a href="/hexadoku-sudoku-16-solver">Hexadoku (Sudoku 16x16) Solver</a> — <a href="/sudoku-5x5-solver">Sudoku 5x5 Solver</a> — <a href="/kakuro-solver">Kakuro Solver</a></div>
</form>
<h2 class="h2_form" id="f1">9x9 Sudoku generator (to solve)</h2>
<form id="sudoku_generator" method="post">
<button data-post="generate,size=9" post="generate,size=9">Generate</button>
</form>
</div>
<!-- advert -->
<div id='div-gpt-ad-1407836210596-0' style='min-width:336px;min-height:280px'></div>
<!-- !advert -->
<!-- questions -->
<h2>Answers to Questions (FAQ)</h2>
<div id="questions">
<div class="qa" data-edit="<strong>You can edit this FAQ section, review it or improve it!</strong>" itemscope itemtype="http://schema.org/Question"><h3 id="q1" itemprop="name">What is a Sudoku? (Definition)</h3>
<div itemprop="acceptedAnswer" itemscope itemtype="http://schema.org/Answer"><div itemprop="text"><p>Sudoku is a logic puzzle consisting of filling a 9x9 grid with the digits 1 through 9. Each digit must appear exactly once in each row, each column, and each of the nine 3x3 blocks.</p>
<p>Variations exist with different grid sizes or with symbols (letters, icons). The mathematical structure remains the same: it is a constraint satisfaction problem where each symbol must adhere to local uniqueness rules.</p></div></div></div>
<div class="qa" data-edit="<strong>You can edit this FAQ section, review it or improve it!</strong>" itemscope itemtype="http://schema.org/Question"><h3 id="q2" itemprop="name">How to fill the Sudoku grid?</h3>
<div itemprop="acceptedAnswer" itemscope itemtype="http://schema.org/Answer"><div itemprop="text"><p>The grid can be filled by copying and pasting a sequence of 81 characters (numbers or symbols), or by directly entering the values into the cells.</p>
<p>The numbers $ 1 $ to $ 9 $ are accepted. For <a href="https://www.dcode.fr/wordoku-solver">Wordoku</a>-style variants, letters can also be used, provided that 9 distinct symbols are employed.</p>
<div class="example"><p><u>Example:</u> Copy the Sudoku content in the first cell (top left) <code>97 1 5 5 9 2 18 4 8 7 26 92 3 6 2 9 19 4572</code> to get:</p></div>
<p><table class="gridhtml"><tr><td>9</td><td>7</td><td>␣</td><td>1</td><td>␣</td><td>␣</td><td>␣</td><td>␣</td><td>5</td></tr><tr><td>␣</td><td>␣</td><td>5</td><td>␣</td><td>9</td><td>␣</td><td>2</td><td>␣</td><td>1</td></tr><tr><td>8</td><td>␣</td><td>␣</td><td>␣</td><td>4</td><td>␣</td><td>␣</td><td>␣</td><td>␣</td></tr><tr><td>␣</td><td>␣</td><td>␣</td><td>␣</td><td>8</td><td>␣</td><td>␣</td><td>␣</td><td>␣</td></tr><tr><td>␣</td><td>␣</td><td>␣</td><td>7</td><td>␣</td><td>␣</td><td>␣</td><td>␣</td><td>␣</td></tr><tr><td>␣</td><td>␣</td><td>␣</td><td>␣</td><td>2</td><td>6</td><td>␣</td><td>␣</td><td>9</td></tr><tr><td>2</td><td>␣</td><td>␣</td><td>3</td><td>␣</td><td>␣</td><td>␣</td><td>␣</td><td>6</td></tr><tr><td>␣</td><td>␣</td><td>␣</td><td>2</td><td>␣</td><td>␣</td><td>9</td><td>␣</td><td>␣</td></tr><tr><td>␣</td><td>␣</td><td>1</td><td>9</td><td>␣</td><td>4</td><td>5</td><td>7</td><td>2</td></tr></table></p></div></div></div>
<div class="qa" data-edit="<strong>You can edit this FAQ section, review it or improve it!</strong>" itemscope itemtype="http://schema.org/Question"><h3 id="q3" itemprop="name">How does the step by step works?</h3>
<div itemprop="acceptedAnswer" itemscope itemtype="http://schema.org/Answer"><div itemprop="text"><p>The program solves <dfn>9x9 Sudoku</dfn> puzzles like a human would, by combining logical deductions.</p>
<p>— Candidate calculation: For each empty cell, dCode determines the set of possible values compatible with the row, column, and block constraints.</p>
<p>— <i>Only possible value</i>: If a cell has only one candidate, that value is validated.</p>
<p>— <i>Only possible cell</i>: If, for a given number, only one cell in a row, column, or block can contain it, that value is validated.</p>
<div class="warning"><p>When no further direct deductions are possible, the solver uses backtracking. It selects a cell with a minimal number of candidates, tests a value, and then continues the deductions. If there is an inconsistency (no solution), it goes back and tries another value. The choice is not random: it relies on heuristics designed to reduce the search tree and speed up the solution. This method is the fastest for the solver; it is possible that sometimes a <i>slower, complex deduction</i> could achieve the same result.</p></div></div></div></div>
<div class="qa" data-edit="<strong>You can edit this FAQ section, review it or improve it!</strong>" itemscope itemtype="http://schema.org/Question"><h3 id="q4" itemprop="name">What is a block of Sudoku?</h3>
<div itemprop="acceptedAnswer" itemscope itemtype="http://schema.org/Answer"><div itemprop="text"><p>In a standard 9x9 grid, a block (also called a region, group, sector, or subgrid) is a 3x3 square. There are 9 blocks in total.</p></div></div></div>
<div class="qa" data-edit="<strong>You can edit this FAQ section, review it or improve it!</strong>" itemscope itemtype="http://schema.org/Question"><h3 id="q5" itemprop="name">How to test if a sudoku has a unique solution?</h3>
<div itemprop="acceptedAnswer" itemscope itemtype="http://schema.org/Answer"><div itemprop="text"><p>dCode calculates all the solutions for the sudoku, not only the first one. To check a homemade sudoku, the solver can confirm that there is only one solution.</p></div></div></div>
<div class="qa" data-edit="<strong>You can edit this FAQ section, review it or improve it!</strong>" itemscope itemtype="http://schema.org/Question"><h3 id="q6" itemprop="name">When was Sudoku invented?</h3>
<div itemprop="acceptedAnswer" itemscope itemtype="http://schema.org/Answer"><div itemprop="text"><p>The modern form of Sudoku was published in 1979 by Howard Garns in the American magazine Dell under the name <i>Number Place</i>.</p>
<p>The game was later popularized in Japan in the 1980s by the Nikoli company, which named it <i>Sudoku</i>, a contraction of <i>Sūji wa dokushin ni kagiru</i>, meaning <i>numbers must remain unique</i>.</p></div></div></div>
<div class="qa" data-edit="<strong>You can edit this FAQ section, review it or improve it!</strong>" itemscope itemtype="http://schema.org/Question"><h3 id="q7" itemprop="name">How many distinct sudokus exist?</h3>
<div itemprop="acceptedAnswer" itemscope itemtype="http://schema.org/Answer"><div itemprop="text"><p>A single row can consist of $ 9! $ (<a href="https://www.dcode.fr/factorial">Factorial</a> of 9) different ways, same for the columns, but the whole sudoku has a number of possibilities much less than $ 9!^9 $, because some permutations can lead to identical grids. The total number of grids is $ 9! \times 72^2 \times 2^7 \times 27704267971 = 6670903752021072936960 $ <a href="https://www.dcode.fr/combinations">combinations</a> (result demonstrated in 2005).</p></div></div></div>
<div class="qa" data-edit="<strong>You can edit this FAQ section, review it or improve it!</strong>" itemscope itemtype="http://schema.org/Question"><h3 id="q8" itemprop="name">What is the minimum number of starting squares for a unique solution?</h3>
<div itemprop="acceptedAnswer" itemscope itemtype="http://schema.org/Answer"><div itemprop="text"><p>For a sudoku to have only one solution, it must have at least 17 pre-filled boxes out of the 81 total. Gary McGuire and his team proved this <a href="https://arxiv.org/pdf/1201.0749" class="external" rel="noopener " target="_blank">here <svg style='display:inline-block;width:1em;height:1em;' fill='currentColor' viewbox='0 -4 48 48'><path d='M36 24c-1.2 0-2 .8-2 2v12c0 1.2-.8 2-2 2H10c-1.2 0-2-.8-2-2V16c0-1.2.8-2 2-2h12c1.2 0 2-.8 2-2s-.8-2-2-2H10c-3.4 0-6 2.6-6 6v22c0 3.4 2.6 6 6 6h22c3.4 0 6-2.6 6-6V26c0-1.2-.8-2-2-2zm7.8-18.8a2.41 2.41 0 0 0-1-1c-.2-.2-.6-.2-.8-.2H30c-1.2 0-2 .8-2 2s.8 2 2 2h7.2L18.6 26.6a1.93 1.93 0 0 0 0 2.8c.4.4.8.6 1.4.6s1-.2 1.4-.6L40 10.8V18c0 1.2.8 2 2 2s2-.8 2-2V6c0-.2 0-.6-.2-.8z'></path></svg></a> by using an algorithm to perform a systematic computer search. They first cataloged the 5,472,730,530 distinct sudoku puzzles. Next, they created a program to check whether sudoku puzzles with 16 pre-filled squares had a unique solution. Their exhaustive search found no sudoku with only 16 pre-filled squares having a unique solution, thus confirming the minimum number of 17 pre-filled squares needed.</p></div></div></div>
<div class="qa" data-edit="<strong>You can edit this FAQ section, review it or improve it!</strong>" itemscope itemtype="http://schema.org/Question"><h3 id="q9" itemprop="name">Does a rectangular sudoku or non square sudoku exist?</h3>
<div itemprop="acceptedAnswer" itemscope itemtype="http://schema.org/Answer"><div itemprop="text"><p>By keeping the sudoku NxN rules that require the N characters to be used on each row and column, then it is impossible to respect them if the sudoku is not square.</p>
<p>Some variants of the square sudoku, however, use non-square inner blocks (see sudoku 6x6, sudoku 7x7 or sudoku 8x8)</p></div></div></div>
<button class="contact">âť“ Ask a new question</button>
</div>
<!-- !questions -->
<!-- advert -->
<ins class='adsbygoogle' style='display:block;min-width:336px;min-height:280px' data-ad-client='ca-pub-2941823798983528' data-ad-slot='9424003936' data-ad-format='rectangle'></ins>
<!-- !advert -->
<!-- source -->
<h2>Source code</h2>
<p class="info">dCode retains ownership of the "Sudoku Solver" source code. Any algorithm for the "Sudoku Solver" algorithm, applet or snippet or script (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or any "Sudoku Solver" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) or any database download or API access for "Sudoku Solver" or any other element are not public (except explicit open source licence). Same with the download for offline use on PC, mobile, tablet, iPhone or Android app.<br/>
Reminder: dCode is an educational and teaching resource, accessible online for free and for everyone.
</p>
<!-- !source -->
<!-- citation -->
<h2>Cite dCode</h2>
<div class="info"><p>The content of the page "Sudoku Solver" and its results may be freely copied and reused, including for commercial purposes, provided that dCode.fr is cited as the source (Creative Commons CC-BY free distribution license).</p>
<p>Exporting the results is free and can be done simply by clicking on the export icons ⤓ (.csv or .txt format) or ⧉ (copy and paste).</p>
<p>To cite dCode.fr on another website, use the link: <nobr>https://www.dcode.fr/sudoku-solver</nobr></p>
<p>In a scientific article or book, the recommended bibliographic citation is: <i>Sudoku Solver</i> on dCode.fr [online website], retrieved on 2026-10-17, <small><nobr>https://www.dcode.fr/sudoku-solver</nobr></small></p>
</div>
<!-- !citation -->
<div id="comments">
<form action="#">
<h2>Need Help ?</h2>
<p class="info">Please, check our <a href='https://discord.gg/bKdbZeP' target='_blank' rel='noopener'>dCode Discord</a> community for help requests!<br>NB: for encrypted messages, test our automatic <a href='/cipher-identifier'>cipher identifier</a>!</p>
<h2>Questions / Comments</h2>
<button id="comments_button" class="contact">Write a message</button>
<p class="info">Feedback and suggestions are welcome so that dCode offers the best 'Sudoku Solver' tool for free! Thank you!</p>
</form>
</div>
</div>
<!-- !center -->
<!-- right -->
<div id="right">
<!-- summary -->
<div id="lang_select"><a href="https://www.dcode.fr/solveur-sudoku" hreflang="fr"><img src="https://www.dcode.fr/images/flag-fr.png" alt="French (Français)" title="French (Français)" width="40" height="25" loading="lazy"></a> <a href="https://www.dcode.fr/solucionador-sudoku" hreflang="es"><img src="https://www.dcode.fr/images/flag-es.png" alt="Spanish (Español)" title="Spanish (Español)" width="40" height="25" loading="lazy"></a> </div>
<div class="heading_bar">Summary</div>
<div id="right_part_to_hide">
<div id="summary"><ul><li><a href="#f0" class="form">Solve a sudoku grid</a></li><li><a href="#f1" class="form">9x9 Sudoku generator (to solve)</a></li><li><a href="#q1" class="question">What is a Sudoku? (Definition)</a></li><li><a href="#q2" class="question">How to fill the Sudoku grid?</a></li><li><a href="#q3" class="question">How does the step by step works?</a></li><li><a href="#q4" class="question">What is a block of Sudoku?</a></li><li><a href="#q5" class="question">How to test if a sudoku has a unique solution?</a></li><li><a href="#q6" class="question">When was Sudoku invented?</a></li><li><a href="#q7" class="question">How many distinct sudokus exist?</a></li><li><a href="#q8" class="question">What is the minimum number of starting squares for a unique solution?</a></li><li><a href="#q9" class="question">Does a rectangular sudoku or non square sudoku exist?</a></li></ul></div>
<!-- !summary -->
<!-- similar tools -->
<div class="heading_bar">Similar pages</div>
<div id="similar_tools"><ul><li><a href="sudoku-5x5-solver">Sudoku 5x5 Solver</a></li><li><a href="hexadoku-sudoku-16-solver">Hexadoku (Sudoku 16x16) Solver</a></li><li><a href="irregular-sudoku-solver">Irregular NxN Sudoku Solver</a></li><li><a href="kakuro-solver">Kakuro Solver</a></li><li><a href="latin-square">Latin Square</a></li><li><a href="magic-square">Magic Square</a></li><li><a href="sudoku-10-solver">10x10 Sudoku Solver</a></li><li><a href="tools-list">DCODE'S TOOLS LIST</a></li></ul></div>
<!-- !similar tools -->
<!-- support -->
<div class="heading_bar">Support dCode</div>
<div id="support"><div data-dialog="support">Make a donation:<ul><li><a href="https://www.paypal.com/cgi-bin/webscr?cmd=_s-xclick&hosted_button_id=S53H3S52HJH6N&source=url" rel="noopener" target="_blank">Paypal</a></li><li><a href="https://www.patreon.com/dcode_fr/membership" rel="noopener" target="_blank">Patreon</a></li><li><a href="javascript:;">Cryptocurrencies</a></li></ul></div>Participate in the Discord forum:<ul><li><a href="https://discord.gg/bKdbZeP" rel="noopener" target="_blank">Discord</a></li></ul><span id="support_dialog"> </span></div>
<!-- !support -->
<!-- livechat -->
<div class="heading_bar">Forum/Help</div>
<div id="livechat"><a href="https://discord.gg/bKdbZeP" target="_blank" rel="noopener"><img src="https://www.dcode.fr/images/discord-logo.png" width="150" height="41" alt="Discuss" loading="lazy" /></a></div>
<!-- !livechat -->
<!-- keywords -->
<div class="heading_bar">Keywords</div>
<div id="keywords">sudoku,grid,9x9,row,column,block</div>
<!-- !keywords -->
<!-- links -->
<div class="heading_bar">Links</div>
<div id="links"><ul><li><a href="about">Contact</a></li><li><a href="about">About dCode</a></li><li><a href="mobile-app">dCode App</a></li><li><a href="https://en.wikipedia.org/" rel="noopener" target="_blank">Wikipedia</a></li></ul></div>
<!-- !links -->
</div>
<!-- !right_menu_to_hide -->
</div>
<!-- fin droit -->
<!-- bottom -->
<br class="spacer" />
<div id="bottom">
<div id="source">https://www.dcode.fr/sudoku-solver</div>
<div>© 2026 <abbr title='DeCODE'>dCode</abbr> — The ultimate collection of tools for games, math, and puzzles.</div>
</div>
<!-- !bottom -->
<a id="up-button">â–˛</a>
<span id="help_dialog"> </span>
</div>
<div id="slideout" class="contact">Feedback</div>
<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/qtip2/3.0.3/jquery.qtip.min.css">
<link rel="stylesheet" href="https://ajax.googleapis.com/ajax/libs/jqueryui/1.12.1/themes/smoothness/jquery-ui.css">
<script>window.dCode={'tool':{'address':"sudoku-solver",'title':"Sudoku Solver",'url':"https://www.dcode.fr/sudoku-solver"},'lang':"en",'url':"https://www.dcode.fr"};</script>
<script src="https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js"></script>
<script>window.jQuery || document.write('<script src="https://www.dcode.fr/static/jquery/jquery-2.2.4.min.js"><\/script>')</script>
<script src="https://cdnjs.cloudflare.com/ajax/libs/qtip2/3.0.3/jquery.qtip.min.js"></script>
<script>window.jQuery.qtip || document.write('<script src="https://www.dcode.fr/static/jquery/qtip/jquery.qtip-3.0.3.min.js"><\/script>')</script>
<script src="https://ajax.googleapis.com/ajax/libs/jqueryui/1.12.1/jquery-ui.min.js"></script>
<script>window.jQuery.ui || document.write('<script src="https://www.dcode.fr/static/jquery/ui/jquery-ui-1.12.1.min.js"><\/script>')</script>
<script src="https://www.dcode.fr/static/dcode3.110.js"></script>
<script type="application/ld+json">{"@context":"http://schema.org/","@type":"Organization","name":"dCode","url":"https://www.dcode.fr/","foundingDate": "2009"}</script>
<script src="https://www.dcode.fr/static/dcode/sudoku.js?_=1776955243"></script>
<script>var sudoku_solver_sudoku = Object.create(SUDOKU); sudoku_solver_sudoku.init('sudoku_solver_sudoku','sudoku'); sudoku_solver_sudoku.sudoku({'size':9});</script>
<script type='text/javascript' src='https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.9/MathJax.js?config=TeX-MML-AM_CHTML&locale=en'></script>
<script>if (!window.MathJax) { var script = document.createElement('script'); script.src = 'https://unpkg.com/[email protected]/MathJax.js?config=TeX-MML-AM_CHTML&locale=en'; document.head.appendChild(script); }</script>
<script>if (!window.MathJax) { var script = document.createElement('script'); script.src = 'https://cdnjs.cloudflare.com/polyfill/v3/polyfill.min.js'; document.head.appendChild(script); script = document.createElement('script'); script.src = 'https://www.dcode.fr/static/mathjax/MathJax-2.7.7/unpacked/MathJax.js?config=TeX-MML-AM_CHTML&locale=en'; document.head.appendChild(script); }</script>
<script type='text/x-mathjax-config'>MathJax.Hub.Config({ 'HTML-CSS': { linebreaks: { automatic: true, width: 'container' } }, 'CommonHTML': { linebreaks: { automatic: true, width: 'container' } }, 'PreviewHTML': { linebreaks: { automatic: true, width: 'container' } }, 'SVG': { linebreaks: { automatic: true, width: 'container' } }, 'TeX': {MAXBUFFER: 20971520}, 'tex2jax': { inlineMath: [ ['$ ',' $'] ], displayMath: [ ['$$','$$'] ] }, 'asciimath2jax': { delimiters: [ ['$ ',' $'] ] }, menuSettings: { zoom: 'DoubleClick' } });
MathJax.Hub.Register.MessageHook('Math Processing Error',function (message) { document.getElementById(message[1].MathJax.error.inputID+'-Frame').innerHTML = message[1].MathJax.error.originalText; });
for (const jax of MathJax.Hub.getAllJax()) {jax.SourceElement().previousSibling.classList.add('notranslate');}
</script>
<script>window.dCode.adBlock=true;</script>
<script type='text/javascript' src='/static/ads/ad_service2.js'></script><script async src='//pagead2.googlesyndication.com/pagead/js/adsbygoogle.js'></script><script async src='//securepubads.g.doubleclick.net/tag/js/gpt.js'></script><script>
document.addEventListener('DOMContentLoaded', () => {
document.querySelectorAll('.adsbygoogle').forEach(() => {
(window.adsbygoogle = window.adsbygoogle || []).push({});
});
});
</script><script async src='https://www.googletagmanager.com/gtag/js?id=UA-647045-2'></script>
<script>window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'UA-647045-2');
dataLayer.push({'gtm.start': new Date().getTime(), 'event': 'gtm.js'});
</script><script>if ('sudoku-solver' && is_local_storage_available() && localStorage.length > 5 && window.dCode.lang == 'fr' && !window.location.href.includes('v5')) { var announcement_h3 = document.createElement('h3'); announcement_h3.innerHTML = `dCode prépare une nouvelle interface. Venez tester et donner votre avis sur la <a href=sudoku-solver&v5 rel=nofollow>nouvelle page Sudoku Solver</a> !`; document.getElementById('center').prepend(announcement_h3); };</script><script>if (is_local_storage_available() && localStorage.length > 5 && window.dCode.lang == 'en' && !window.location.href.includes('v5')) { var announcement_h3 = document.createElement('h3'); announcement_h3.innerHTML = `dCode is preparing a new interface. Come test and give your feedback on the <a href=sudoku-solver&v5 rel=nofollow>new page: Sudoku Solver</a>!`; document.getElementById('center').prepend(announcement_h3); };</script><script>if (window.location.hostname != 'www.d'+'code.fr' && window.location.hostname != 'www-dcode-fr.translate.goog') window.location.href = window.location.href.replace(window.location.hostname, 'www.d'+'code.fr');</script>
<script async src='//cdn-a.yieldlove.com/v2/yieldlove.js?dcode.fr'></script>
<script>var googletag = googletag || {}; googletag.cmd = googletag.cmd || []; googletag.cmd.push(function() { googletag.pubads().disableInitialLoad(); googletag.enableServices(); });</script>
<script type='text/javascript'>
googletag.cmd.push(function() {
googletag.defineSlot('/53015287,18673364/dcode.fr_d_320x100_1', [[320, 100], [320, 50]], 'div-gpt-ad-1407836191040-0').addService(googletag.pubads());
googletag.display('div-gpt-ad-1407836191040-0');
});
googletag.cmd.push(function() {
googletag.defineSlot('/53015287,18673364/dcode.fr_d_336x280_1', [[336, 280], [300, 250]], 'div-gpt-ad-1407836210596-0').addService(googletag.pubads());
googletag.display('div-gpt-ad-1407836210596-0');
});
googletag.cmd.push(function() {
googletag.defineSlot('/53015287,18673364/dcode.fr_d_336x280_2', [[336, 280], [300, 250]], 'div-gpt-ad-1407836252997-0').addService(googletag.pubads());
googletag.display('div-gpt-ad-1407836252997-0');
});
</script>
<!-- !content -->
<style>[data-dialog] {display: none;}</style>
<script>(function(){function c(){var b=a.contentDocument||(a.contentWindow&&a.contentWindow.document);if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'a4bb4b1e4db32aca',t:'MTc5MjE5ODA2MQ=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();</script></body>
</html>
| # |
Url |
Url |
Source |
Date |
| 1 |
https://www.dcode.fr/sudoku-solver |
|
2026-10-17 00:47:41 |
| 2 |
https://errdoc.gabia.io/modsecurit… |
|
2026-10-17 00:47:41 |
| 3 |
https://www.iglinks.io/hamadij482-… |
|
2026-10-17 00:47:40 |
| 4 |
https://www.texarkanatwins.com/%25… |
|
2026-10-17 00:47:38 |
| 5 |
https://www.texarkanatwins.com/%25… |
|
2026-10-17 00:47:38 |
| 6 |
https://www.texarkanatwins.com/%25… |
|
2026-10-17 00:47:38 |
| 7 |
https://www.texarkanatwins.com/%25… |
|
2026-10-17 00:47:38 |
| 8 |
https://www.texarkanatwins.com/%25… |
|
2026-10-17 00:47:38 |
| 9 |
https://www.texarkanatwins.com/%25… |
|
2026-10-17 00:47:37 |
| 10 |
https://www.texarkanatwins.com/%25… |
|
2026-10-17 00:47:37 |
| 11 |
https://www.texarkanatwins.com/%25… |
|
2026-10-17 00:47:37 |
| 12 |
https://www.texarkanatwins.com/%25… |
|
2026-10-17 00:47:37 |
| 13 |
https://www.texarkanatwins.com/%25… |
|
2026-10-17 00:47:37 |
| 14 |
https://www.texarkanatwins.com/%25… |
|
2026-10-17 00:47:36 |
| 15 |
https://www.thebolditalic.com/?gi=… |
|
2026-10-17 00:47:36 |
| 16 |
https://www.texarkanatwins.com/%25… |
|
2026-10-17 00:47:36 |
| 17 |
https://www.texarkanatwins.com/%25… |
|
2026-10-17 00:47:35 |
| 18 |
https://www.texarkanatwins.com/%25… |
|
2026-10-17 00:47:35 |
| 19 |
https://www.texarkanatwins.com/%25… |
|
2026-10-17 00:47:35 |
| 20 |
https://www.texarkanatwins.com/%25… |
|
2026-10-17 00:47:35 |