Sudoku strategies using graph theory

Sudoku strategies using graph theory

In this paper we discuss sudoku-solving strategies and how graph theory can be used to explain some of the advanced techniques. There are many websites that provide tutorials on solving sudoku puzzles. The sites [1] and [2] discuss the xy-chain technique, and the two explanations are quite different...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical gazette 2024-07, Vol.108 (572), p.275-282
1. Verfasser: Brown, Jeff
Format: Artikel
Sprache:eng
Schlagworte:
Candidates
Graph theory
Graphs
Puzzles
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 282
container_issue 572
container_start_page 275
container_title Mathematical gazette
container_volume 108
creator Brown, Jeff
description In this paper we discuss sudoku-solving strategies and how graph theory can be used to explain some of the advanced techniques. There are many websites that provide tutorials on solving sudoku puzzles. The sites [1] and [2] discuss the xy-chain technique, and the two explanations are quite different. We will define xy-chains as paths in a graph, and properties of the paths show why the technique works.
doi_str_mv 10.1017/mag.2024.68
format Article
fullrecord <record><control><sourceid>proquest_cambr</sourceid><recordid>TN_cdi_proquest_journals_3095852835</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cupid>10_1017_mag_2024_68</cupid><sourcerecordid>3095852835</sourcerecordid><originalsourceid>FETCH-LOGICAL-c151t-bffe00177774ff8d48e838fe575620c18f7e70c59bfc1a4d370c8e84569d462a3</originalsourceid><addsrcrecordid>eNpFkE1LxDAQhoMoWFdP_oGCXlMnH5OmR1n8ggUP6jmkbdLt6m7XJD34782ygnMZBh7mfXkIuWZQMWD13dYOFQcuK6VPSMEBFVWC61NSAHCkiDU_JxcxbgBAC6kKcvs299PnXMYUbHLD6GI5x3E3lEOw-3WZ1m4KP5fkzNuv6K7-9oJ8PD68L5_p6vXpZXm_oh1DlmjrvYNcI4_0XvdSOy20d1ij4tAx7WtXQ4dN6ztmZS_ykRGJquml4lYsyM3x7z5M37OLyWymOexypBHQoEauBWaKHqnObtsw9oP7xxiYgwiTRZiDCKO0-AXo-k8_</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3095852835</pqid></control><display><type>article</type><title>Sudoku strategies using graph theory</title><source>Cambridge University Press Journals Complete</source><creator>Brown, Jeff</creator><creatorcontrib>Brown, Jeff</creatorcontrib><description>In this paper we discuss sudoku-solving strategies and how graph theory can be used to explain some of the advanced techniques. There are many websites that provide tutorials on solving sudoku puzzles. The sites [1] and [2] discuss the xy-chain technique, and the two explanations are quite different. We will define xy-chains as paths in a graph, and properties of the paths show why the technique works.</description><identifier>ISSN: 0025-5572</identifier><identifier>EISSN: 2056-6328</identifier><identifier>DOI: 10.1017/mag.2024.68</identifier><language>eng</language><publisher>Cambridge, UK: Cambridge University Press</publisher><subject>Candidates ; Graph theory ; Graphs ; Puzzles</subject><ispartof>Mathematical gazette, 2024-07, Vol.108 (572), p.275-282</ispartof><rights>The Authors, 2024 Published by Cambridge University Press on behalf of The Mathematical Association</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.cambridge.org/core/product/identifier/S0025557224000688/type/journal_article$$EHTML$$P50$$Gcambridge$$H</linktohtml><link.rule.ids>164,314,780,784,27924,27925,55628</link.rule.ids></links><search><creatorcontrib>Brown, Jeff</creatorcontrib><title>Sudoku strategies using graph theory</title><title>Mathematical gazette</title><addtitle>Math. Gaz</addtitle><description>In this paper we discuss sudoku-solving strategies and how graph theory can be used to explain some of the advanced techniques. There are many websites that provide tutorials on solving sudoku puzzles. The sites [1] and [2] discuss the xy-chain technique, and the two explanations are quite different. We will define xy-chains as paths in a graph, and properties of the paths show why the technique works.</description><subject>Candidates</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Puzzles</subject><issn>0025-5572</issn><issn>2056-6328</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid/><recordid>eNpFkE1LxDAQhoMoWFdP_oGCXlMnH5OmR1n8ggUP6jmkbdLt6m7XJD34782ygnMZBh7mfXkIuWZQMWD13dYOFQcuK6VPSMEBFVWC61NSAHCkiDU_JxcxbgBAC6kKcvs299PnXMYUbHLD6GI5x3E3lEOw-3WZ1m4KP5fkzNuv6K7-9oJ8PD68L5_p6vXpZXm_oh1DlmjrvYNcI4_0XvdSOy20d1ij4tAx7WtXQ4dN6ztmZS_ykRGJquml4lYsyM3x7z5M37OLyWymOexypBHQoEauBWaKHqnObtsw9oP7xxiYgwiTRZiDCKO0-AXo-k8_</recordid><startdate>202407</startdate><enddate>202407</enddate><creator>Brown, Jeff</creator><general>Cambridge University Press</general><scope/></search><sort><creationdate>202407</creationdate><title>Sudoku strategies using graph theory</title><author>Brown, Jeff</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c151t-bffe00177774ff8d48e838fe575620c18f7e70c59bfc1a4d370c8e84569d462a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Candidates</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Puzzles</topic><toplevel>online_resources</toplevel><creatorcontrib>Brown, Jeff</creatorcontrib><jtitle>Mathematical gazette</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Brown, Jeff</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Sudoku strategies using graph theory</atitle><jtitle>Mathematical gazette</jtitle><addtitle>Math. Gaz</addtitle><date>2024-07</date><risdate>2024</risdate><volume>108</volume><issue>572</issue><spage>275</spage><epage>282</epage><pages>275-282</pages><issn>0025-5572</issn><eissn>2056-6328</eissn><abstract>In this paper we discuss sudoku-solving strategies and how graph theory can be used to explain some of the advanced techniques. There are many websites that provide tutorials on solving sudoku puzzles. The sites [1] and [2] discuss the xy-chain technique, and the two explanations are quite different. We will define xy-chains as paths in a graph, and properties of the paths show why the technique works.</abstract><cop>Cambridge, UK</cop><pub>Cambridge University Press</pub><doi>10.1017/mag.2024.68</doi><tpages>8</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0025-5572
ispartof Mathematical gazette, 2024-07, Vol.108 (572), p.275-282
issn 0025-5572
2056-6328
language eng
recordid cdi_proquest_journals_3095852835
source Cambridge University Press Journals Complete
subjects Candidates
Graph theory
Graphs
Puzzles
title Sudoku strategies using graph theory
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T17%3A28%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cambr&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Sudoku%20strategies%20using%20graph%20theory&rft.jtitle=Mathematical%20gazette&rft.au=Brown,%20Jeff&rft.date=2024-07&rft.volume=108&rft.issue=572&rft.spage=275&rft.epage=282&rft.pages=275-282&rft.issn=0025-5572&rft.eissn=2056-6328&rft_id=info:doi/10.1017/mag.2024.68&rft_dat=%3Cproquest_cambr%3E3095852835%3C/proquest_cambr%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3095852835&rft_id=info:pmid/&rft_cupid=10_1017_mag_2024_68&rfr_iscdi=true