# HG changeset patch
# User Rob Beezer
# Date 1310354460 25200
# Node ID 99a8c2df1140923badca5e9c1be356647f234813
# Parent e91d55c111a109fb0e2bf21453a1102a25d2c043
11379: reviewer documentation changes
diff --git a/sage/combinat/tiling.py b/sage/combinat/tiling.py
--- a/sage/combinat/tiling.py
+++ b/sage/combinat/tiling.py
@@ -10,12 +10,12 @@
This module defines two classes:
-- :class:`sage.games.quantumino.Polyomino` class, to represent polyominoes
+- :class:`sage.combinat.tiling.Polyomino` class, to represent polyominoes
in arbitrary dimension. The goal of this class is to return all the
rotated, reflected and/or translated copies of a polyomino that are
contained in a certain box.
-- :class:`sage.games.quantumino.TilingSolver` class, to solve the general
+- :class:`sage.combinat.tiling.TilingSolver` class, to solve the general
problem of tiling a rectangular `n`-dimensional box with a set of
`n`-dimensional polyominoes. One can specify if rotations and reflections
are allowed or not and if pieces can be reused or not. This class convert
@@ -447,7 +447,7 @@
.. NOTE::
- No guarentee of unicity.
+ No guarantee of unicity.
INPUT:
diff --git a/sage/games/quantumino.py b/sage/games/quantumino.py
--- a/sage/games/quantumino.py
+++ b/sage/games/quantumino.py
@@ -10,7 +10,7 @@
Mathematique in Montreal by Franco Saliola during winter 2011.
The solution uses the dancing links code which is in Sage and is based on
-the more general code available in the module ``sage.combinat.tiling``.
+the more general code available in the module :mod:`sage.combinat.tiling`.
Dancing links were originally introduced by Donald Knuth in 2000 [3]. In
particular, Knuth used dancing links to solve tilings of a region by 2D
pentaminos. Here we extend the method for 3D pentaminos.
@@ -75,7 +75,7 @@
Polyomino: [(0, 0, 0), (0, 1, 0), (0, 2, 0), (0, 2, 1), (1, 0, 0)], Color: orange
sage: s.show3d() # long time (<1s)
-The solution is iterable. This may be used to explicit the positions of each
+The solution is iterable. This may be used to explicitly list the positions of each
pentamino::
sage: for p in s: p # long time (<1s)
@@ -128,8 +128,9 @@
...
StopIteration
-The implementation allows a lot of introspection. From the TilingSolver
-object, it is possible to retrieve the rows that are passed to the DLX
+The implementation allows a lot of introspection. From the
+:class:`~sage.combinat.tiling.TilingSolver` object,
+it is possible to retrieve the rows that are passed to the DLX
solver and count them. It is also possible to get an instance of the DLX
solver to play with it::
@@ -371,7 +372,7 @@
##############################
class QuantuminoSolver(SageObject):
r"""
- Return the Quantumino solver for the giving box where one of the
+ Return the Quantumino solver for the given box where one of the
pentamino is put aside.
INPUT: