61127a3fd5
* wrap/python/buddy.i (__le__, __lt__, __eq__, __ne__, __ge__ __gt__): New operators for bdd. * wrap/python/spot.i (__le__, __lt__, __eq__, __ne__, __ge__ __gt__, __hash__): New operators for formula. (nl_cout, nl_cerr): New functions. * wrap/python/tests/bddnqueen.py, wrap/python/tests/interdep.py, wrap/python/tests/ltl2tgba.py, wrap/python/tests/ltlparse.py, wrap/python/tests/ltlsimple.py, wrap/python/tests/minato.py, wrap/python/tests/modgray.py: Adjust to the new print syntax by using sys.output.write() or nl_cout() instead. * wrap/python/tests/optionmap.py: Remove all print calls. * wrap/python/ajax/spot.in: Massive adjustments in order to work with both Python 2 and 3. In python 3, reopening stdout as unbuffered requires it to be open as binary, which in turns requires any string output to be encoded manually. BaseHTTPServer and CGIHTTPServer have been merged into http.server, so we have to try two different import syntaxes. execfile no longer exists, so it has to be emulated. This also fixes two bugs where the script would segfault on empty input, or when calling Tau03 on automata with less then one acceptance conditions.
107 lines
2.9 KiB
Python
Executable file
107 lines
2.9 KiB
Python
Executable file
# -*- mode: python; coding: utf-8 -*-
|
|
# Copyright (C) 2010, 2011, 2012 Laboratoire de Recherche et
|
|
# Développement de l'EPITA.
|
|
# Copyright (C) 2003, 2004 Laboratoire d'Informatique de Paris 6
|
|
# (LIP6), département Systèmes Répartis Coopératifs (SRC), Université
|
|
# Pierre et Marie Curie.
|
|
#
|
|
# This file is part of Spot, a model checking library.
|
|
#
|
|
# Spot is free software; you can redistribute it and/or modify it
|
|
# under the terms of the GNU General Public License as published by
|
|
# the Free Software Foundation; either version 2 of the License, or
|
|
# (at your option) any later version.
|
|
#
|
|
# Spot is distributed in the hope that it will be useful, but WITHOUT
|
|
# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
|
|
# or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
|
|
# License for more details.
|
|
#
|
|
# You should have received a copy of the GNU General Public License
|
|
# along with Spot; see the file COPYING. If not, write to the Free
|
|
# Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
|
# 02111-1307, USA.
|
|
|
|
# Python translation of the C++ example from the BuDDy distribution.
|
|
# (compare with buddy/examples/queen/queen.cxx)
|
|
|
|
import sys
|
|
from buddy import *
|
|
from spot import nl_cout
|
|
|
|
# Build the requirements for all other fields than (i,j) assuming
|
|
# that (i,j) has a queen.
|
|
def build(i, j):
|
|
a = b = c = d = bddtrue
|
|
|
|
# No one in the same column.
|
|
for l in side:
|
|
if l != j:
|
|
a &= X[i][j] >> -X[i][l]
|
|
|
|
# No one in the same row.
|
|
for k in side:
|
|
if k != i:
|
|
b &= X[i][j] >> -X[k][j]
|
|
|
|
# No one in the same up-right diagonal.
|
|
for k in side:
|
|
ll = k - i + j
|
|
if ll >= 0 and ll < N:
|
|
if k != i:
|
|
c &= X[i][j] >> -X[k][ll]
|
|
|
|
# No one in the same down-right diagonal.
|
|
for k in side:
|
|
ll = i + j - k
|
|
if ll >= 0 and ll < N:
|
|
if k != i:
|
|
c &= X[i][j] >> -X[k][ll]
|
|
|
|
global queen
|
|
queen &= a & b & c & d
|
|
|
|
|
|
|
|
# Get the number of queens from the command-line, or default to 8.
|
|
if len(sys.argv) > 1:
|
|
N = int(argv[1])
|
|
else:
|
|
N = 8
|
|
|
|
side = range(N)
|
|
|
|
# Initialize with 100000 nodes, 10000 cache entries and NxN variables.
|
|
bdd_init(N * N * 256, 10000)
|
|
bdd_setvarnum(N * N)
|
|
|
|
queen = bddtrue
|
|
|
|
# Build variable array.
|
|
X = [[bdd_ithvar(i*N+j) for j in side] for i in side]
|
|
|
|
# Place a queen in each row.
|
|
for i in side:
|
|
e = bddfalse
|
|
for j in side:
|
|
e |= X[i][j]
|
|
queen &= e
|
|
|
|
# Build requirements for each variable(field).
|
|
for i in side:
|
|
for j in side:
|
|
sys.stdout.write("Adding position %d, %d\n" % (i, j))
|
|
build(i, j)
|
|
|
|
# Print the results.
|
|
sys.stdout.write("There are %d solutions, one is:\n" %
|
|
bdd_satcount(queen))
|
|
solution = bdd_satone(queen)
|
|
bdd_printset(solution)
|
|
nl_cout()
|
|
|
|
# Cleanup all BDD variables before calling bdd_done(), otherwise
|
|
# bdd_delref will be called after bdd_done() and this is unsafe in
|
|
# optimized builds.
|
|
X = e = queen = solution = 0
|
|
bdd_done()
|