commit 856898b3958626d2400e59b53dc134283addc988
author Georg Brandl <georg@python.org> Thu Dec 30 22:11:50 2010 +0000
committer Georg Brandl <georg@python.org> Thu Dec 30 22:11:50 2010 +0000
tree 2018f1418921ad20ef0fce86f9e28df09c3e5567
parent a3fe8e0b9face74e34b938dd657c4048d5f0dadf

Harmonize docstrings.  Move redemo from Tools/scripts to Tools/demo.  Add a README file to Tools/demo.

Tools/demo/queens.py

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