<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.sudopedia.org/index.php?action=history&amp;feed=atom&amp;title=B%2FB_Plot</id>
	<title>B/B Plot - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://www.sudopedia.org/index.php?action=history&amp;feed=atom&amp;title=B%2FB_Plot"/>
	<link rel="alternate" type="text/html" href="https://www.sudopedia.org/index.php?title=B/B_Plot&amp;action=history"/>
	<updated>2026-04-29T05:28:23Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.34.1</generator>
	<entry>
		<id>https://www.sudopedia.org/index.php?title=B/B_Plot&amp;diff=214&amp;oldid=prev</id>
		<title>Rooted: Created page with &quot;A '''Bivalue/Bilocal Plot''' is a diagram that shows the strong links between candidates in a Sudoku grid.  Such a diagram is a useful tool to identify c...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.sudopedia.org/index.php?title=B/B_Plot&amp;diff=214&amp;oldid=prev"/>
		<updated>2020-06-04T00:49:19Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;A &amp;#039;&amp;#039;&amp;#039;&lt;a href=&quot;/wiki/Bivalue&quot; title=&quot;Bivalue&quot;&gt;Bivalue&lt;/a&gt;/&lt;a href=&quot;/wiki/Bilocal&quot; title=&quot;Bilocal&quot;&gt;Bilocal&lt;/a&gt; Plot&amp;#039;&amp;#039;&amp;#039; is a diagram that shows the &lt;a href=&quot;/wiki/Strong_link&quot; title=&quot;Strong link&quot;&gt;strong links&lt;/a&gt; between &lt;a href=&quot;/wiki/Candidate&quot; title=&quot;Candidate&quot;&gt;candidates&lt;/a&gt; in a Sudoku &lt;a href=&quot;/wiki/Grid&quot; title=&quot;Grid&quot;&gt;grid&lt;/a&gt;.  Such a diagram is a useful tool to identify c...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;A '''[[Bivalue]]/[[Bilocal]] Plot''' is a diagram that shows the [[strong link]]s between [[candidate]]s in a Sudoku [[grid]].&lt;br /&gt;
&lt;br /&gt;
Such a diagram is a useful tool to identify [[chain]]s or [[loop]]s that can be used to [[eliminate]] candidates.&lt;br /&gt;
&lt;br /&gt;
== Reference ==&lt;br /&gt;
* David Eppstein. ''[http://arxiv.org/abs/cs.DS/0507053 Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku.]'' arXiv:cs/0507053.&lt;br /&gt;
&lt;br /&gt;
{{stub}}&lt;/div&gt;</summary>
		<author><name>Rooted</name></author>
		
	</entry>
</feed>