Merge pull request #685 from Axelrod-Python/684

Add a better doctest for setting random seed.

docs/tutorials/advanced/setting_a_seed.rst

@@ -11,14 +11,13 @@ set. To do this we can use the `seed` function::
     >>> import axelrod as axl
     >>> players = (axl.Random(), axl.MetaMixer())  # Two stochastic strategies
     >>> axl.seed(0)
-    >>> axl.Match(players, turns=3).play()
-    [('D', 'C'), ('D', 'D'), ('C', 'C')]
+    >>> results = axl.Match(players, turns=3).play()
 
 We obtain the same results is it is played with the same seed::
 
     >>> axl.seed(0)
-    >>> axl.Match(players, turns=3).play()
-    [('D', 'C'), ('D', 'D'), ('C', 'C')]
+    >>> results == axl.Match(players, turns=3).play()
+    True
 
 Note that this is equivalent to::
 
@@ -27,9 +26,8 @@ Note that this is equivalent to::
     >>> players = (axl.Random(), axl.MetaMixer())
     >>> random.seed(0)
     >>> numpy.random.seed(0)
-    >>> axl.Match(players, turns=3).play()
-    [('D', 'C'), ('D', 'D'), ('C', 'C')]
+    >>> results = axl.Match(players, turns=3).play()
     >>> numpy.random.seed(0)
     >>> random.seed(0)
-    >>> axl.Match(players, turns=3).play()
-    [('D', 'C'), ('D', 'D'), ('C', 'C')]
+    >>> results == axl.Match(players, turns=3).play()
+    True

docs/tutorials/further_topics/spatial_tournaments.rst

@@ -76,16 +76,11 @@ It is also possible to create a probabilistic ending spatial tournament with the
     >>> prob_end_spatial_tournament = axl.ProbEndSpatialTournament(players, edges=edges, prob_end=.1, repetitions=1)
     >>> prob_end_results = prob_end_spatial_tournament.play(keep_interactions=True)
 
-We see that the match lengths are no longer all equal (we are here printing the
-length of the interactions)::
+We see that the match lengths are no longer all equal::
 
     >>> axl.seed(0)
-    >>> for index_pair, interaction in prob_end_results.interactions.items():
-    ...     player1 = spatial_tournament.players[index_pair[0]]
-    ...     player2 = spatial_tournament.players[index_pair[1]]
-    ...     rep_length = [len(rep) for rep in interaction]
-    ...     print('%s vs %s: %s' % (player1, player2, rep_length))
-    Defector vs Tit For Tat: [43]
-    Cooperator vs Grudger: [7]
-    Defector vs Grudger: [5]
-    Cooperator vs Tit For Tat: [1]
+    >>> lengths = []
+    >>> for interaction in prob_end_results.interactions.values():
+    ...     lengths.append(len(interaction[0]))
+    >>> min(lengths) != max(lengths)
+    True