<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="et">
	<id>http://www.lambda.ee/w/index.php?action=history&amp;feed=atom&amp;title=Iti0120lab72cnf</id>
	<title>Iti0120lab72cnf - Redigeerimiste ajalugu</title>
	<link rel="self" type="application/atom+xml" href="http://www.lambda.ee/w/index.php?action=history&amp;feed=atom&amp;title=Iti0120lab72cnf"/>
	<link rel="alternate" type="text/html" href="http://www.lambda.ee/w/index.php?title=Iti0120lab72cnf&amp;action=history"/>
	<updated>2026-10-29T05:38:52Z</updated>
	<subtitle>Selle lehekülje redigeerimiste ajalugu</subtitle>
	<generator>MediaWiki 1.43.11</generator>
	<entry>
		<id>http://www.lambda.ee/w/index.php?title=Iti0120lab72cnf&amp;diff=14936&amp;oldid=prev</id>
		<title>PriitJ: Uus lehekülg: &#039;&lt;pre&gt; # k6ikide numbriga ruutude peal kutsun välja cnf_sweeper() # enne peab olema teada kinniste naabrite list  def cnf_sweeper(m, neighbors):     &quot;&quot;&quot;CNF komponent ühe ruudu k...&#039;</title>
		<link rel="alternate" type="text/html" href="http://www.lambda.ee/w/index.php?title=Iti0120lab72cnf&amp;diff=14936&amp;oldid=prev"/>
		<updated>2018-10-30T13:36:24Z</updated>

		<summary type="html">&lt;p&gt;Uus lehekülg: &amp;#039;&amp;lt;pre&amp;gt; # k6ikide numbriga ruutude peal kutsun välja cnf_sweeper() # enne peab olema teada kinniste naabrite list  def cnf_sweeper(m, neighbors):     &amp;quot;&amp;quot;&amp;quot;CNF komponent ühe ruudu k...&amp;#039;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Uus lehekülg&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;lt;pre&amp;gt;&lt;br /&gt;
# k6ikide numbriga ruutude peal kutsun välja cnf_sweeper()&lt;br /&gt;
# enne peab olema teada kinniste naabrite list&lt;br /&gt;
&lt;br /&gt;
def cnf_sweeper(m, neighbors):&lt;br /&gt;
    &amp;quot;&amp;quot;&amp;quot;CNF komponent ühe ruudu kohta&lt;br /&gt;
    parameetrid: m - miinide arv&lt;br /&gt;
                neighbors - naabrite list&amp;quot;&amp;quot;&amp;quot;&lt;br /&gt;
    n = len(neighbors)&lt;br /&gt;
    cnf = []&lt;br /&gt;
    for i in range(2**n):&lt;br /&gt;
        binform = &amp;quot;{:0{n}b}&amp;quot;.format(i, n=n)&lt;br /&gt;
        ones = 0&lt;br /&gt;
        clause = []&lt;br /&gt;
        for j in range(n):&lt;br /&gt;
            if binform[j] == &amp;quot;1&amp;quot;:&lt;br /&gt;
                ones += 1&lt;br /&gt;
                clause.append(-neighbors[j])&lt;br /&gt;
            else:&lt;br /&gt;
                clause.append(neighbors[j])&lt;br /&gt;
        if ones != m:&lt;br /&gt;
            cnf.append(tuple(clause))&lt;br /&gt;
            #print(binform, ones, clause)&lt;br /&gt;
    return cnf&lt;br /&gt;
&lt;br /&gt;
test = cnf_sweeper(1, [4, 5, 6, 7])&lt;br /&gt;
print(test)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;/div&gt;</summary>
		<author><name>PriitJ</name></author>
	</entry>
</feed>