summaryrefslogtreecommitdiffstats
path: root/Tools/demo/queens.py
diff options
context:
space:
mode:
authorGeorg Brandl <georg@python.org>2010-12-30 22:11:50 (GMT)
committerGeorg Brandl <georg@python.org>2010-12-30 22:11:50 (GMT)
commit856898b3958626d2400e59b53dc134283addc988 (patch)
tree2018f1418921ad20ef0fce86f9e28df09c3e5567 /Tools/demo/queens.py
parenta3fe8e0b9face74e34b938dd657c4048d5f0dadf (diff)
downloadcpython-856898b3958626d2400e59b53dc134283addc988.zip
cpython-856898b3958626d2400e59b53dc134283addc988.tar.gz
cpython-856898b3958626d2400e59b53dc134283addc988.tar.bz2
Harmonize docstrings. Move redemo from Tools/scripts to Tools/demo. Add a README file to Tools/demo.
Diffstat (limited to 'Tools/demo/queens.py')
-rwxr-xr-xTools/demo/queens.py6
1 files changed, 3 insertions, 3 deletions
diff --git a/Tools/demo/queens.py b/Tools/demo/queens.py
index ffd4bea..dcc1bae 100755
--- a/Tools/demo/queens.py
+++ b/Tools/demo/queens.py
@@ -1,12 +1,12 @@
-#! /usr/bin/env python3
+#!/usr/bin/env python3
-"""N queens problem.
+"""
+N queens problem.
The (well-known) problem is due to Niklaus Wirth.
This solution is inspired by Dijkstra (Structured Programming). It is
a classic recursive backtracking approach.
-
"""
N = 8 # Default; command line overrides