bishbosh 0.1.0.0 → 0.1.1.0

raw patch · 194 files changed

+4202/−3565 lines, 194 filesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

Files

• README.markdown +1/−0
• bishbosh.cabal +43/−25
• bishbosh.spec +1/−1
• changelog.markdown +92/−56
• config/bishbosh.dtd +2/−3
• config/bishbosh.rng +1/−2
• config/rankValues_Carlson.xml +6/−6
• config/rankValues_Kaufman.xml +6/−6
• config/rankValues_Medvedev.xml +6/−6
• copyright +1/−0
• makefile +36/−28
• man/man1/duel.1 +22/−10
• src-exe/BishBosh/Concurrent/Pondering.hs +1/−0
• src-exe/BishBosh/Play.hs +12/−34
• src-exe/BishBosh/State/ApplicationTerminationReason.hs +2/−2
• src-exe/BishBosh/State/PlayState.hs +42/−67
• src-exe/BishBosh/UI/CECP.hs +100/−147
• src-exe/BishBosh/UI/Raw.hs +68/−112
• src-exe/Duel.hs +19/−3
• src-exe/Duel/Data/Options.hs +48/−31
• src-exe/Duel/IO/Logger.hs +1/−0
• src-exe/Duel/Process/Handles.hs +95/−0
• src-exe/Duel/Process/Intermediary.hs +135/−76
• src-exe/Main.hs +29/−35
• src-lib/BishBosh/Attribute/CriterionValue.hs +0/−109
• src-lib/BishBosh/Attribute/CriterionWeight.hs +0/−90
• src-lib/BishBosh/Attribute/Direction.hs +4/−7
• src-lib/BishBosh/Attribute/LogicalColour.hs +3/−2
• src-lib/BishBosh/Attribute/LogicalColourOfSquare.hs +1/−0
• src-lib/BishBosh/Attribute/MoveType.hs +1/−1
• src-lib/BishBosh/Attribute/Rank.hs +19/−19
• src-lib/BishBosh/Attribute/RankValues.hs +0/−142
• src-lib/BishBosh/Attribute/WeightedMeanAndCriterionValues.hs +0/−83
• src-lib/BishBosh/Cartesian/Abscissa.hs +2/−2
• src-lib/BishBosh/Cartesian/Coordinates.hs +15/−15
• src-lib/BishBosh/Cartesian/Ordinate.hs +2/−2
• src-lib/BishBosh/Cartesian/Vector.hs +3/−3
• src-lib/BishBosh/Component/CastlingMove.hs +3/−3
• src-lib/BishBosh/Component/Move.hs +9/−16
• src-lib/BishBosh/Component/Piece.hs +9/−12
• src-lib/BishBosh/Component/PieceSquareByCoordinatesByRank.hs +30/−27
• src-lib/BishBosh/Component/QualifiedMove.hs +3/−3
• src-lib/BishBosh/Component/Turn.hs +5/−7
• src-lib/BishBosh/ContextualNotation/PGN.hs +24/−22
• src-lib/BishBosh/ContextualNotation/PGNDatabase.hs +19/−16
• src-lib/BishBosh/ContextualNotation/PositionHashQualifiedMoveTree.hs +42/−43
• src-lib/BishBosh/ContextualNotation/QualifiedMoveForest.hs +34/−34
• src-lib/BishBosh/ContextualNotation/StandardAlgebraic.hs +10/−10
• src-lib/BishBosh/Data/Either.hs +2/−1
• src-lib/BishBosh/Data/Exception.hs +3/−2
• src-lib/BishBosh/Data/Float.hs +0/−35
• src-lib/BishBosh/Data/Integral.hs +1/−26
• src-lib/BishBosh/Data/Num.hs +1/−0
• src-lib/BishBosh/Data/Time.hs +0/−41
• src-lib/BishBosh/Evaluation/Fitness.hs +77/−116
• src-lib/BishBosh/Evaluation/PositionHashQuantifiedGameTree.hs +57/−72
• src-lib/BishBosh/Evaluation/QuantifiedGame.hs +37/−47
• src-lib/BishBosh/Input/CECPFeatures.hs +10/−13
• src-lib/BishBosh/Input/CECPOptions.hs +38/−27
• src-lib/BishBosh/Input/CategorisedCommandLineOptions.hs +1/−0
• src-lib/BishBosh/Input/CriteriaWeights.hs +78/−114
• src-lib/BishBosh/Input/EvaluationOptions.hs +32/−42
• src-lib/BishBosh/Input/IOOptions.hs +20/−33
• src-lib/BishBosh/Input/NativeUIOptions.hs +17/−30
• src-lib/BishBosh/Input/Options.hs +26/−56
• src-lib/BishBosh/Input/PGNOptions.hs +6/−6
• src-lib/BishBosh/Input/PieceSquareTable.hs +3/−2
• src-lib/BishBosh/Input/RankValues.hs +133/−0
• src-lib/BishBosh/Input/SearchOptions.hs +28/−25
• src-lib/BishBosh/Input/UIOptions.hs +30/−46
• src-lib/BishBosh/Metric/CriterionValue.hs +79/−0
• src-lib/BishBosh/Metric/CriterionWeight.hs +96/−0
• src-lib/BishBosh/Metric/RankValue.hs +97/−0
• src-lib/BishBosh/Metric/WeightedMeanAndCriterionValues.hs +121/−0
• src-lib/BishBosh/Model/DrawReason.hs +0/−100
• src-lib/BishBosh/Model/Game.hs +68/−72
• src-lib/BishBosh/Model/GameTerminationReason.hs +0/−124
• src-lib/BishBosh/Model/GameTree.hs +34/−46
• src-lib/BishBosh/Model/MoveFrequency.hs +25/−36
• src-lib/BishBosh/Model/PositionHashTree.hs +8/−7
• src-lib/BishBosh/Model/Result.hs +0/−98
• src-lib/BishBosh/Notation/MoveNotation.hs +3/−3
• src-lib/BishBosh/Notation/PureCoordinate.hs +7/−7
• src-lib/BishBosh/Property/Opposable.hs +1/−0
• src-lib/BishBosh/Property/SelfValidating.hs +61/−0
• src-lib/BishBosh/Property/ShowFloat.hs +7/−7
• src-lib/BishBosh/Property/Switchable.hs +53/−0
• src-lib/BishBosh/Rule/DrawReason.hs +102/−0
• src-lib/BishBosh/Rule/GameTerminationReason.hs +124/−0
• src-lib/BishBosh/Rule/Result.hs +98/−0
• src-lib/BishBosh/Search/AlphaBeta.hs +41/−44
• src-lib/BishBosh/Search/DynamicMoveData.hs +3/−2
• src-lib/BishBosh/Search/EphemeralData.hs +5/−4
• src-lib/BishBosh/Search/KillerMoves.hs +7/−6
• src-lib/BishBosh/Search/Search.hs +34/−35
• src-lib/BishBosh/Search/SearchState.hs +8/−18
• src-lib/BishBosh/Search/TranspositionValue.hs +10/−10
• src-lib/BishBosh/Search/Transpositions.hs +2/−2
• src-lib/BishBosh/State/Board.hs +45/−51
• src-lib/BishBosh/State/CastleableRooksByLogicalColour.hs +4/−4
• src-lib/BishBosh/State/CoordinatesByRankByLogicalColour.hs +16/−13
• src-lib/BishBosh/State/EnPassantAbscissa.hs +2/−2
• src-lib/BishBosh/State/InstancesByPosition.hs +25/−31
• src-lib/BishBosh/State/MaybePieceByCoordinates.hs +32/−27
• src-lib/BishBosh/State/Position.hs +3/−3
• src-lib/BishBosh/State/TurnsByLogicalColour.hs +10/−8
• src-lib/BishBosh/StateProperty/Censor.hs +8/−15
• src-lib/BishBosh/Text/Case.hs +1/−0
• src-lib/BishBosh/Text/ShowPrefix.hs +1/−0
• src-lib/BishBosh/Time/GameClock.hs +88/−0
• src-lib/BishBosh/Time/StopWatch.hs +82/−0
• src-lib/BishBosh/Type/Count.hs +155/−0
• src-lib/BishBosh/Type/Crypto.hs +45/−0
• src-lib/BishBosh/Type/Length.hs +96/−0
• src-lib/BishBosh/Type/Mass.hs +72/−0
• src-lib/BishBosh/Types.hs +0/−99
• src-lib/BishBosh/UI/Command.hs +6/−5
• src-lib/BishBosh/UI/PrintObject.hs +2/−4
• src-lib/BishBosh/UI/ReportObject.hs +9/−11
• src-lib/BishBosh/UI/SetObject.hs +4/−3
• src-test/BishBosh/Test/HUnit/Cartesian/Coordinates.hs +3/−3
• src-test/BishBosh/Test/HUnit/Cartesian/Vector.hs +2/−2
• src-test/BishBosh/Test/HUnit/Component/CastlingMove.hs +2/−2
• src-test/BishBosh/Test/HUnit/Component/Move.hs +2/−2
• src-test/BishBosh/Test/HUnit/Component/Zobrist.hs +3/−2
• src-test/BishBosh/Test/HUnit/ContextualNotation/PGN.hs +16/−16
• src-test/BishBosh/Test/HUnit/ContextualNotation/PositionHashQualifiedMoveTree.hs +3/−2
• src-test/BishBosh/Test/HUnit/ContextualNotation/StandardAlgebraic.hs +8/−7
• src-test/BishBosh/Test/HUnit/Evaluation/Fitness.hs +32/−44
• src-test/BishBosh/Test/HUnit/Input/Options.hs +5/−7
• src-test/BishBosh/Test/HUnit/Model/Game.hs +12/−12
• src-test/BishBosh/Test/HUnit/Model/GameTree.hs +11/−9
• src-test/BishBosh/Test/HUnit/Model/PositionHashTree.hs +4/−3
• src-test/BishBosh/Test/HUnit/Search/Search.hs +10/−14
• src-test/BishBosh/Test/HUnit/State/Board.hs +2/−2
• src-test/BishBosh/Test/HUnit/Time/GameClock.hs +83/−0
• src-test/BishBosh/Test/HUnit/Time/StopWatch.hs +63/−0
• src-test/BishBosh/Test/QuickCheck/Attribute/CriterionWeight.hs +0/−37
• src-test/BishBosh/Test/QuickCheck/Attribute/MoveType.hs +1/−0
• src-test/BishBosh/Test/QuickCheck/Attribute/RankValues.hs +0/−49
• src-test/BishBosh/Test/QuickCheck/Cartesian/Coordinates.hs +2/−2
• src-test/BishBosh/Test/QuickCheck/Cartesian/Vector.hs +6/−5
• src-test/BishBosh/Test/QuickCheck/Component/Move.hs +5/−4
• src-test/BishBosh/Test/QuickCheck/Component/QualifiedMove.hs +5/−4
• src-test/BishBosh/Test/QuickCheck/Component/Turn.hs +20/−20
• src-test/BishBosh/Test/QuickCheck/Component/Zobrist.hs +4/−5
• src-test/BishBosh/Test/QuickCheck/ContextualNotation/PGN.hs +15/−12
• src-test/BishBosh/Test/QuickCheck/ContextualNotation/PGNComment.hs +8/−5
• src-test/BishBosh/Test/QuickCheck/ContextualNotation/PositionHashQualifiedMoveTree.hs +4/−4
• src-test/BishBosh/Test/QuickCheck/ContextualNotation/QualifiedMoveForest.hs +3/−3
• src-test/BishBosh/Test/QuickCheck/ContextualNotation/StandardAlgebraic.hs +13/−10
• src-test/BishBosh/Test/QuickCheck/Evaluation/PositionHashQuantifiedGameTree.hs +7/−4
• src-test/BishBosh/Test/QuickCheck/Input/CECPFeatures.hs +3/−5
• src-test/BishBosh/Test/QuickCheck/Input/CECPOptions.hs +2/−1
• src-test/BishBosh/Test/QuickCheck/Input/CriteriaWeights.hs +13/−15
• src-test/BishBosh/Test/QuickCheck/Input/EvaluationOptions.hs +13/−19
• src-test/BishBosh/Test/QuickCheck/Input/IOOptions.hs +1/−6
• src-test/BishBosh/Test/QuickCheck/Input/NativeUIOptions.hs +5/−8
• src-test/BishBosh/Test/QuickCheck/Input/Options.hs +12/−32
• src-test/BishBosh/Test/QuickCheck/Input/PGNOptions.hs +1/−1
• src-test/BishBosh/Test/QuickCheck/Input/PieceSquareTable.hs +4/−3
• src-test/BishBosh/Test/QuickCheck/Input/RankValues.hs +37/−0
• src-test/BishBosh/Test/QuickCheck/Input/SearchOptions.hs +4/−4
• src-test/BishBosh/Test/QuickCheck/Input/UIOptions.hs +3/−7
• src-test/BishBosh/Test/QuickCheck/Input/Verbosity.hs +1/−0
• src-test/BishBosh/Test/QuickCheck/Metric/CriterionWeight.hs +33/−0
• src-test/BishBosh/Test/QuickCheck/Metric/RankValue.hs +56/−0
• src-test/BishBosh/Test/QuickCheck/Model/DrawReason.hs +0/−34
• src-test/BishBosh/Test/QuickCheck/Model/Game.hs +13/−12
• src-test/BishBosh/Test/QuickCheck/Model/GameTerminationReason.hs +0/−48
• src-test/BishBosh/Test/QuickCheck/Model/GameTree.hs +3/−2
• src-test/BishBosh/Test/QuickCheck/Model/MoveFrequency.hs +3/−7
• src-test/BishBosh/Test/QuickCheck/Model/Result.hs +0/−63
• src-test/BishBosh/Test/QuickCheck/Notation/ICCFNumeric.hs +3/−2
• src-test/BishBosh/Test/QuickCheck/Notation/MoveNotation.hs +1/−0
• src-test/BishBosh/Test/QuickCheck/Notation/PureCoordinate.hs +3/−2
• src-test/BishBosh/Test/QuickCheck/Notation/Smith.hs +3/−2
• src-test/BishBosh/Test/QuickCheck/Rule/DrawReason.hs +34/−0
• src-test/BishBosh/Test/QuickCheck/Rule/GameTerminationReason.hs +48/−0
• src-test/BishBosh/Test/QuickCheck/Rule/Result.hs +63/−0
• src-test/BishBosh/Test/QuickCheck/Search/KillerMoves.hs +12/−15
• src-test/BishBosh/Test/QuickCheck/Search/Search.hs +2/−2
• src-test/BishBosh/Test/QuickCheck/Search/SearchState.hs +8/−19
• src-test/BishBosh/Test/QuickCheck/State/Board.hs +3/−3
• src-test/BishBosh/Test/QuickCheck/State/CastleableRooksByLogicalColour.hs +2/−2
• src-test/BishBosh/Test/QuickCheck/State/InstancesByPosition.hs +1/−1
• src-test/BishBosh/Test/QuickCheck/State/TurnsByLogicalColour.hs +2/−2
• src-test/BishBosh/Test/QuickCheck/Time/StopWatch.hs +33/−0
• src-test/BishBosh/Test/QuickCheck/UI/Command.hs +2/−2
• src-test/BishBosh/Test/QuickCheck/UI/PrintObject.hs +1/−0
• src-test/BishBosh/Test/QuickCheck/UI/ReportObject.hs +1/−0
• src-test/BishBosh/Test/QuickCheck/UI/SetObject.hs +1/−1
• src-test/HUnit.hs +4/−0
• src-test/QuickCheck.hs +7/−5

@@ -39,3 +39,4 @@ ## Author  This application is written & maintained by Dr. Alistair Ward.+

@@ -1,4 +1,4 @@-cabal-version: 2.0+cabal-version: 2.4  -- This file is part of BishBosh. --@@ -16,10 +16,9 @@ -- along with BishBosh.  If not, see <http://www.gnu.org/licenses/>.  Name:		bishbosh-Version:	0.1.0.0+Version:	0.1.1.0 Copyright:	(C) 2018 Dr. Alistair Ward--- License:	GPL-3.0-or-later-License:	GPL-3+License:	GPL-3.0-or-later License-file:	LICENSE Author:		Dr. Alistair Ward Stability:	stable@@ -86,6 +85,12 @@     Manual:		True     Default:		False +-- Whether, to wrap common types in 'newtype' for increased type-safety. CAVEAT: there's a ~10% performance-penalty.+flag newtypewrappers+    Description:	Wrap common types in newtype for increased type-safety.+    Manual:		True+    Default:		False+ -- Concurrency is used to implement Pondering, & parallelism is used when searching through archived games. flag threaded     Description:	Build for parallel runtime.@@ -112,16 +117,12 @@     Exposed-modules:         BishBosh.Attribute.CaptureMoveSortAlgorithm         BishBosh.Attribute.ColourScheme-        BishBosh.Attribute.CriterionValue-        BishBosh.Attribute.CriterionWeight         BishBosh.Attribute.Direction         BishBosh.Attribute.LogicalColour         BishBosh.Attribute.LogicalColourOfSquare         BishBosh.Attribute.MoveType         BishBosh.Attribute.PhysicalColour         BishBosh.Attribute.Rank-        BishBosh.Attribute.RankValues-        BishBosh.Attribute.WeightedMeanAndCriterionValues         BishBosh.Cartesian.Abscissa         BishBosh.Cartesian.Coordinates         BishBosh.Cartesian.Ordinate@@ -144,14 +145,12 @@         BishBosh.Data.Either         BishBosh.Data.Enum         BishBosh.Data.Exception-        BishBosh.Data.Float         BishBosh.Data.Foldable         BishBosh.Data.Integral         BishBosh.Data.List         BishBosh.Data.Num         BishBosh.Data.Ratio         BishBosh.Data.RoseTree-        BishBosh.Data.Time         BishBosh.Evaluation.Fitness         BishBosh.Evaluation.PositionHashQuantifiedGameTree         BishBosh.Evaluation.QuantifiedGame@@ -166,17 +165,19 @@         BishBosh.Input.Options         BishBosh.Input.PGNOptions         BishBosh.Input.PieceSquareTable+        BishBosh.Input.RankValues         BishBosh.Input.SearchOptions         BishBosh.Input.StandardOpeningOptions         BishBosh.Input.UIOptions         BishBosh.Input.Verbosity-        BishBosh.Model.DrawReason+        BishBosh.Metric.CriterionValue+        BishBosh.Metric.CriterionWeight+        BishBosh.Metric.RankValue+        BishBosh.Metric.WeightedMeanAndCriterionValues         BishBosh.Model.Game-        BishBosh.Model.GameTerminationReason         BishBosh.Model.GameTree         BishBosh.Model.MoveFrequency         BishBosh.Model.PositionHashTree-        BishBosh.Model.Result         BishBosh.Notation.ICCFNumeric         BishBosh.Notation.MoveNotation         BishBosh.Notation.PureCoordinate@@ -191,7 +192,12 @@         BishBosh.Property.Orientated         BishBosh.Property.Reflectable         BishBosh.Property.Rotatable+        BishBosh.Property.SelfValidating         BishBosh.Property.ShowFloat+        BishBosh.Property.Switchable+        BishBosh.Rule.DrawReason+        BishBosh.Rule.GameTerminationReason+        BishBosh.Rule.Result         BishBosh.Search.AlphaBeta         BishBosh.Search.DynamicMoveData         BishBosh.Search.EphemeralData@@ -216,7 +222,12 @@         BishBosh.Text.Encoding         BishBosh.Text.ShowList         BishBosh.Text.ShowPrefix-        BishBosh.Types+        BishBosh.Time.GameClock+        BishBosh.Time.StopWatch+        BishBosh.Type.Count+        BishBosh.Type.Crypto+        BishBosh.Type.Length+        BishBosh.Type.Mass         BishBosh.UI.Command         BishBosh.UI.PrintObject         BishBosh.UI.ReportObject@@ -255,7 +266,7 @@      if flag(polyparse)         Build-depends:		polyparse-        CPP-Options:		-DUSE_POLYPARSE=1+        CPP-Options:		-DUSE_POLYPARSE=2         Exposed-modules:	BishBosh.Text.Poly     else         Build-depends:		parsec@@ -263,6 +274,9 @@     if flag(narrownumbers)         CPP-Options:		-DUSE_NARROW_NUMBERS +    if flag(newtypewrappers)+        CPP-Options:		-DUSE_NEWTYPE_WRAPPERS+     if flag(threaded)         Build-depends:		parallel >= 3.0         CPP-Options:		-DUSE_PARALLEL@@ -304,7 +318,6 @@         hxt,         mtl,         random,-        time,         toolshed >= 0.18      if impl(ghc >= 7.0)@@ -356,6 +369,7 @@     Other-modules:         Duel.Data.Options         Duel.IO.Logger+        Duel.Process.Handles         Duel.Process.Intermediary         Paths_bishbosh @@ -365,6 +379,7 @@         containers,         data-default,         filepath,+        hxt,         process >= 1.6.4      CPP-Options:	-DMOVE_NOTATION='S'@@ -406,6 +421,8 @@         BishBosh.Test.HUnit.Search.Search         BishBosh.Test.HUnit.State.Board         BishBosh.Test.HUnit.Text.AutoComplete+        BishBosh.Test.HUnit.Time.GameClock+        BishBosh.Test.HUnit.Time.StopWatch         Paths_bishbosh      Build-depends:@@ -418,16 +435,15 @@         HUnit,         hxt,         mtl,+        random,         toolshed >= 0.18 ---  CPP-Options:	-DUSE_SEARCH-     if impl(ghc >= 8.0)         GHC-options:	-Wredundant-constraints      if flag(polyparse)         Build-depends:	polyparse-        CPP-Options:	-DUSE_POLYPARSE=1+        CPP-Options:	-DUSE_POLYPARSE=2     else         Build-depends:	parsec @@ -441,12 +457,10 @@      Other-modules:         BishBosh.Test.QuickCheck.Attribute.CaptureMoveSortAlgorithm-        BishBosh.Test.QuickCheck.Attribute.CriterionWeight         BishBosh.Test.QuickCheck.Attribute.Direction         BishBosh.Test.QuickCheck.Attribute.LogicalColour         BishBosh.Test.QuickCheck.Attribute.MoveType         BishBosh.Test.QuickCheck.Attribute.Rank-        BishBosh.Test.QuickCheck.Attribute.RankValues         BishBosh.Test.QuickCheck.Cartesian.Coordinates         BishBosh.Test.QuickCheck.Cartesian.Vector         BishBosh.Test.QuickCheck.Component.Move@@ -471,20 +485,23 @@         BishBosh.Test.QuickCheck.Input.Options         BishBosh.Test.QuickCheck.Input.PGNOptions         BishBosh.Test.QuickCheck.Input.PieceSquareTable+        BishBosh.Test.QuickCheck.Input.RankValues         BishBosh.Test.QuickCheck.Input.SearchOptions         BishBosh.Test.QuickCheck.Input.StandardOpeningOptions         BishBosh.Test.QuickCheck.Input.UIOptions         BishBosh.Test.QuickCheck.Input.Verbosity-        BishBosh.Test.QuickCheck.Model.DrawReason+        BishBosh.Test.QuickCheck.Metric.CriterionWeight+        BishBosh.Test.QuickCheck.Metric.RankValue         BishBosh.Test.QuickCheck.Model.Game-        BishBosh.Test.QuickCheck.Model.GameTerminationReason         BishBosh.Test.QuickCheck.Model.GameTree         BishBosh.Test.QuickCheck.Model.MoveFrequency-        BishBosh.Test.QuickCheck.Model.Result         BishBosh.Test.QuickCheck.Notation.ICCFNumeric         BishBosh.Test.QuickCheck.Notation.MoveNotation         BishBosh.Test.QuickCheck.Notation.PureCoordinate         BishBosh.Test.QuickCheck.Notation.Smith+        BishBosh.Test.QuickCheck.Rule.DrawReason+        BishBosh.Test.QuickCheck.Rule.GameTerminationReason+        BishBosh.Test.QuickCheck.Rule.Result         BishBosh.Test.QuickCheck.Search.KillerMoves         BishBosh.Test.QuickCheck.Search.Search         BishBosh.Test.QuickCheck.Search.SearchState@@ -495,6 +512,7 @@         BishBosh.Test.QuickCheck.StateProperty.Censor         BishBosh.Test.QuickCheck.State.TurnsByLogicalColour         BishBosh.Test.QuickCheck.Text.Encoding+        BishBosh.Test.QuickCheck.Time.StopWatch         BishBosh.Test.QuickCheck.UI.Command         BishBosh.Test.QuickCheck.UI.PrintObject         BishBosh.Test.QuickCheck.UI.ReportObject@@ -519,7 +537,7 @@      if flag(polyparse)         Build-depends:	polyparse-        CPP-Options:	-DUSE_POLYPARSE=1+        CPP-Options:	-DUSE_POLYPARSE=2     else         Build-depends:	parsec 

@@ -24,7 +24,7 @@  Summary:	BishBosh is a chess-game. Name:		bishbosh-Version:	0.1.0.0+Version:	0.1.1.0 Release:	1 License:	GPLv3 # From '/usr/share/doc/packages/rpm/GROUPS'.

@@ -4,79 +4,115 @@ * First version of the package.  ## 0.0.0.2-Minor changes required to build on Windows.+* Minor changes required to build on Windows.  ## 0.0.0.3-Added **Paths_bishbosh** to **Other-modules** section of cabal file.+* Added **Paths_bishbosh** to **Other-modules** section of cabal file.  ## 0.0.0.4-Changed references to author's domain-name.+* Changed references to author's domain-name.  ## 0.0.0.5-Added ability to specify the text-encoding used in a PGN-database file.-Updated list of test-compilers.+* Added ability to specify the text-encoding used in a PGN-database file.+* Updated list of test-compilers.  ## 0.0.0.6-Fixed failure to persist game-state after requesting that the game be restarted.-Fixed parsing of **TextEncoding** in **PGNOptions**.-Replaced module **Distribution.Verbosity** with **BishBosh.Input.Verbosity**.+* Fixed failure to persist game-state after requesting that the game be restarted.+* Fixed parsing of **TextEncoding** in **PGNOptions**.+* Replaced module **Distribution.Verbosity** with **BishBosh.Input.Verbosity**.  ## 0.0.0.7-Rewrote function **BishBosh.Data.RoseTree.countTerminalNodes** in accordance with the suggestions of David Feuer.-Amended function **BishBosh.State.EnPassantAbscissa.mkMaybeEnPassantAbscissa** to guard against exposing one's King after En-passant capture.+* Rewrote function **BishBosh.Data.RoseTree.countTerminalNodes** in accordance with the suggestions of David Feuer.+* Amended function **BishBosh.State.EnPassantAbscissa.mkMaybeEnPassantAbscissa** to guard against exposing one's King after En-passant capture.  ## 0.0.0.8-Corrected the parsing of FEN when an Enpassant-destination defined on file **b** was erroneously interpreted as a bishop in the previous **CastleableRooks** field.-Added parent class **BishBosh.Property.ExtendedPositionDescription.EPD** for **Property.ForsythEdwards.FEN**, for which the latter typically has a default implementation of both methods.+* Corrected the parsing of FEN when an Enpassant-destination defined on file **b** was erroneously interpreted as a bishop in the previous **CastleableRooks** field.+* Added parent class **BishBosh.Property.ExtendedPositionDescription.EPD** for **Property.ForsythEdwards.FEN**, for which the latter typically has a default implementation of both methods.  ## 0.1.0.0 ### Bug-fixes:-	* Upgraded the transposition-table in module **Search.DynamicMoveData**, from merely recording moves (which doesn't include the rank to which a Pawn is promoted), to recording qualified-moves.-	* In function **Search.AlphaBeta.negaMax.descend.selectMax**, amended bound function **isFitter** to prefer shorter move-sequences where fitness is equal, & corrected the scenario in which all nodes were skipped because they were repetitious, but without ever defining alpha.+* Upgraded the transposition-table in module **Search.DynamicMoveData**, from merely recording moves (which doesn't include the rank to which a Pawn is promoted), to recording qualified-moves.+* In function **Search.AlphaBeta.negaMax.descend.selectMax**, amended bound function **isFitter** to prefer shorter move-sequences where fitness is equal, & corrected the scenario in which all nodes were skipped because they were repetitious, but without ever defining alpha.+ ### Features:-	* Added the configurable runtime ability to asynchronously decompress PGN-databases, & to set a maximum number of games to read.-	* Added a configuration-option to normalise the values of specified piece-square tables into the closed unit-interval.-	* Modularised the packaged config-files, by defining XML **External Entities** in the DTD.-	* Added suggestions on failure to parse a user-command, & created a module **Text.AutoComplete** to contain common code.-	* Added runtime commands:-	------------------------------------------	Command				| Purpose-	--------------------------------| --------	**availableMoves**		| to report all available moves from the current position.-	**maxPositionInstances**	| to reveal the maximum number of instances any available position has been visited.-	**reversiblePlyCount**		| to count the number of consecutive reversible plies that have been made.-	------------------------------------------	* Added **makefile** to facilitate common tasks.-	* Removed the configuration-option **preferMovesTowardsCentre** & its implementation in function **Cartesian.Coordinates.radiusSquared**, because of it's conceptually wobbly foundations.+* Added the configurable runtime ability to asynchronously decompress PGN-databases, & to set a maximum number of games to read.+* Added a configuration-option to normalise the values of specified piece-square tables into the closed unit-interval.+* Modularised the packaged config-files, by defining XML **External Entities** in the DTD.+* Added suggestions on failure to parse a user-command, & created a module **Text.AutoComplete** to contain common code.+* Added **makefile** to facilitate common tasks.+* Removed the configuration-option **preferMovesTowardsCentre** & its implementation in function **Cartesian.Coordinates.radiusSquared**, because of it's conceptually wobbly foundations.++### New Runtime Cmmands:+-----------------------------------------+Command				| Purpose+--------------------------------| -------+**availableMoves**		| to report all available moves from the current position.+**maxPositionInstances**	| to reveal the maximum number of instances any available position has been visited.+**reversiblePlyCount**		| to count the number of consecutive reversible plies that have been made.+-----------------------------------------+ ### Command-line Options:-	* Added a new module **Input.CategorisedCommandLineOptions** to improved the partitioning of command-line options into functional categories.-	* Added a command-line option **--formatPieceSquareTableForGNUPlot** to print the piece-square tables in a format suitable for **GNUPlot**.+* Added a new module **Input.CategorisedCommandLineOptions** to improved the partitioning of command-line options into functional categories.+* Added a command-line option **--formatPieceSquareTableForGNUPlot** to print the piece-square tables in a format suitable for **GNUPlot**.+ ### Performance:-	* Included a compilation-flag **unboxedarrays**, to request the use of unboxed arrays where (infrequently) possible.-	* Changed data-type **Component.PieceSquareByCoordinatesByRank.EitherPieceSquareValueByNPiecesByCoordinates**, bringing type **Cartesian.Coordinates.ByCoordinates** inside **Either**, leading to significant space/time gains.-	* Constructed each large constant data-structure in parallel. Bracketed all data-parallel operations with CPP-conditionals controlled by the compilation-flag **threaded**.-	* Parallelised function **Attribute.CriterionValue.calculateWeightedMean**.-### Architectural:-	* Added new modules:-	------------------------------------------	Module				| Purpose-	--------------------------------| --------	**Component.CastlingMove**	| Forked from module **Component.Move**-	**Data.Enum**			| Currently single-function.-	**Data.Foldable**		| Currently single-function.-	**Property.FixedMembership**	| Defines a class to which sum-types can conform.-	**StateProperty.Censor**	| Relocated from directory **State/**-	**StateProperty.Mutator**	| defines a class to express the dual implementations within **State.Board**.-	**StateProperty.Seeker**	| defines a class to express the dual implementations within **State.Board**.-	**Text.Case**			| Forked from **Text.ShowList** to contain case-related operations.-	**Text.Prefix**			| Forked from **Text.ShowList** to define the constant prefixes of log-messages.-	-----------------------------------------+* Included a compilation-flag **unboxedarrays**, to request the use of unboxed arrays where (infrequently) possible.+* Changed data-type **Component.PieceSquareByCoordinatesByRank.EitherPieceSquareValueByNPiecesByCoordinates**, bringing type **Cartesian.Coordinates.ByCoordinates** inside **Either**, leading to significant space/time gains.+* Constructed each large constant data-structure in parallel. Bracketed all data-parallel operations with CPP-conditionals controlled by the compilation-flag **threaded**.+* Parallelised function **Attribute.CriterionValue.calculateWeightedMean**.++### New Modules:+-----------------------------------------+Module				| Purpose+--------------------------------| -------+**Component.CastlingMove**	| Forked from module **Component.Move**.+**Data.Enum**			| Currently single-function.+**Data.Foldable**		| Currently single-function.+**Property.FixedMembership**	| Defines a class to which sum-types can conform.+**StateProperty.Censor**	| Relocated from directory **State/**.+**StateProperty.Mutator**	| defines a class to express the dual implementations within **State.Board**.+**StateProperty.Seeker**	| defines a class to express the dual implementations within **State.Board**.+**Text.Case**			| Forked from **Text.ShowList** to contain case-related operations.+**Text.Prefix**			| Forked from **Text.ShowList** to define the constant prefixes of log-messages.+-----------------------------------------+ ### Testing:-	* Split **src-test/Main.hs** into **src-test/HUnit.hs** & **src-test/QuickCheck.hs**, each referenced independently from the cabal file.-	* Added an executable **duel** (to coordinate a battle between two independently configured instances of **bishbosh**) & a corresponding section-1 man-page.-	* Validated the list of ranks supplied to construct either **Attribute.RankValues.RankValues** or **Input.PieceSquareTable.PieceSquareTable**.+* Split **src-test/Main.hs** into **src-test/HUnit.hs** & **src-test/QuickCheck.hs**, each referenced independently from the cabal file.+* Added an executable **duel** (to coordinate a battle between two independently configured instances of **bishbosh**) & a corresponding section-1 man-page.+* Validated the list of ranks supplied to construct either **Attribute.RankValues.RankValues** or **Input.PieceSquareTable.PieceSquareTable**.+ ### Refactoring:-	* Flattened the nested array **Component.Zobrist.getRandomByCoordinatesByRankByLogicalColour**, by means of a composite index.-	* Reimplemented function **Cartesian.Coordinates.getLogicalColourOfSquare**.-	* Reimplemented function **Cartesian.Coordinates.interpolationsByDestinationBySource** in terms of function **Cartesian.Coordinates.extrapolationsByDirectionByCoordinates**.-	* Used the **LambdaCase** language-extension.+* Flattened the nested array **Component.Zobrist.getRandomByCoordinatesByRankByLogicalColour**, by means of a composite index.+* Reimplemented function **Cartesian.Coordinates.getLogicalColourOfSquare**.+* Reimplemented function **Cartesian.Coordinates.interpolationsByDestinationBySource** in terms of function **Cartesian.Coordinates.extrapolationsByDirectionByCoordinates**.+* Used the **LambdaCase** language-extension.++## 0.1.1.0+### New Modules:+---------------------------------------------------------+New Module					| Purpose+------------------------------------------------| -------+**BishBosh.Time.StopWatch**			| Replaces module **BishBosh.Data.Time** to encapsulate interaction with module **Data.Time.Clock**.+**BishBosh.Time.GameClock**			| Contains two **BishBosh.Time.StopWatch**es to enable module **Duel.Process.Intermediary** to measure the time used by each player.+**BishBosh.Property.Switchable**		| Exports a type-class, which both **BishBosh.Time.StopWatch** & **BishBosh.Time.GameClock** implement, to expose their functionality.+**BishBosh.Property.SelfValidating**		| Exports a type-class, which both **BishBosh.Time.GameClock** & **Duel.Data.Options** implement, to validate themselves.+**BishBosh.Type.Countable**			| Defines newtypes to enhance type-safety, replacing type-synonyms for **Int**. There is a performance-degradation, so this enhancement can be disabled using a new cabal-flag.+**BishBosh.Type.Crypto**			| Self-documentation.+**BishBosh.Type.Length**			| Replaced the polymorphic type-parameters **row** & **column** with newtypes to enhance type-safety.+**BishBosh.Type.Mass**				| Self-documentation.+**BishBosh.Metric.RankValue**			| Replaced the polymorphic type-parameter **rankValue**, with a newtype & a smart-constructor to guard permissible bounds.++### Duel:+* Added command-line option **--verifyConfiguration**, to request that the mutual compatibility of the two configuration-files be verified before forwarding each to a forked instance of **bishbosh**.++### BishBosh:+* Created a new directory **Rule/** to which **Model.**{**DrawReason**, **GameTerminationReason**, **Result**} were relocated.+* Refactored functions **BishBosh.ContextualNotation.PositionHashQualifiedMoveTree.findNextOnymousQualifiedMovesForPosition**, **BishBosh.Model.MoveFrequency.insertMoves** & **BishBosh.Model.GameTree.toMoveFrequency**.+* Evaluation-criteria:+	+ Moved **BishBosh.Attribute.**{**CriterionValue**, **CriterionWeight**, **WeightedMeanAndCriterionValues**} to a new directory **Metric/**+	+ Implemented classes [**Num**, **Fractional**, **Real**] for data-types **BishBosh.Metric.**{**CriterionValue.CriterionValue**, **CriterionWeight.CriterionWeight**}, nullifying the requirement for exports.+	+ Replaced the pointless polymorphic payloads in data-types **BishBosh.Metric.**{**CriterionValue.CriterionValue**, **CriterionWeight.CriterionWeight**, **WeightedMeanAndCriterionValues.WeightedMeanAndCriterionValues**} with concrete types.+* Moved **BishBosh.Attribute.RankValues** to **BishBosh.Input**.+* Checked that (with the possible exception of the King) the Queen is configured as the most valuable rank.+* Avoided repeated calls from module **BishBosh.Evaluation.Fitness** to function **IBishBosh.nput.RankValues.calculateMaximumTotalValue** by adding the record-field **BishBosh.Input.EvaluationOptions.getMaximumTotalRankValue**.+

@@ -30,8 +30,8 @@ 		> 		<!ELEMENT rankValues EMPTY> 			<!ATTLIST rankValues-				rank	(p | r | n | b | q | k)	#REQUIRED-				value	CDATA			#REQUIRED+				rank		(p | r | n | b | q | k)	#REQUIRED+				rankValue	CDATA			#REQUIRED 			> 		<!ENTITY rankValues_Carlson SYSTEM "rankValues_Carlson.xml"> 		<!ENTITY rankValues_Kaufman SYSTEM "rankValues_Kaufman.xml">@@ -145,7 +145,6 @@ 					displaySAN	(False | True)	#IMPLIED 					editMode	(False | True)	#IMPLIED 					forceMode	(False | True)	#IMPLIED-					pause		CDATA		#IMPLIED 					ponderMode	(False | True)	#IMPLIED 					postMode	(False | True)	#IMPLIED 					protocolVersion	CDATA		#IMPLIED

@@ -20,7 +20,7 @@ 					<zeroOrMore> 						<element name="rankValues"> 							<ref name="Rank"/>-							<attribute name="value">+							<attribute name="rankValue"> 								<ref name="ClosedUnitInterval"/> 							</attribute> 						</element>@@ -268,7 +268,6 @@ 													<name>displaySAN</name> 													<name>editMode</name> 													<name>forceMode</name>-													<name>pause</name> 													<name>ponderMode</name> 													<name>postMode</name> 												</choice>

@@ -22,9 +22,9 @@ 	These are the values (in the closed unit-interval rather than the traditional centi-pawns) of various ranks of piece. 	N.B.: derived from <https://www.chessprogramming.org/Point_Value_by_Regression_Analysis#Human_Players>. -->-<rankValues rank="p" value="0.127"/>	<!-- Pawn -->-<rankValues rank="r" value="0.448"/>	<!-- Rook -->-<rankValues rank="b" value="0.309"/>	<!-- Bishop -->-<rankValues rank="n" value="0.271"/>	<!-- Knight -->-<rankValues rank="q" value="1"/>	<!-- Queen -->-<rankValues rank="k" value="0"/>	<!-- King -->+<rankValues rank="p" rankValue="0.127"/>	<!-- Pawn -->+<rankValues rank="r" rankValue="0.448"/>	<!-- Rook -->+<rankValues rank="b" rankValue="0.309"/>	<!-- Bishop -->+<rankValues rank="n" rankValue="0.271"/>	<!-- Knight -->+<rankValues rank="q" rankValue="1"/>		<!-- Queen -->+<rankValues rank="k" rankValue="0"/>		<!-- King -->

@@ -22,9 +22,9 @@ 	These are the values (in the closed unit-interval rather than the traditional centi-pawns) of various ranks of piece 	N.B.: derived from Larry Kaufman's values; <https://www.chessprogramming.org/Point_Value> -->-<rankValues rank="p" value="0.1"/>	<!-- Pawn -->-<rankValues rank="r" value="0.525"/>	<!-- Rook -->-<rankValues rank="b" value="0.35"/>	<!-- Bishop -->-<rankValues rank="n" value="0.35"/>	<!-- Knight -->-<rankValues rank="q" value="1"/>	<!-- Queen -->-<rankValues rank="k" value="0"/>	<!-- King -->+<rankValues rank="p" rankValue="0.1"/>		<!-- Pawn -->+<rankValues rank="r" rankValue="0.525"/>	<!-- Rook -->+<rankValues rank="b" rankValue="0.35"/>		<!-- Bishop -->+<rankValues rank="n" rankValue="0.35"/>		<!-- Knight -->+<rankValues rank="q" rankValue="1"/>		<!-- Queen -->+<rankValues rank="k" rankValue="0"/>		<!-- King -->

@@ -22,9 +22,9 @@ 	These are the values (in the closed unit-interval rather than the traditional centi-pawns) of various ranks of piece. 	N.B.: derived from https://www.chessprogramming.org/Point_Value_by_Regression_Analysis. -->-<rankValues rank="p" value="0.093"/>	<!-- Pawn -->-<rankValues rank="r" value="0.446"/>	<!-- Rook -->-<rankValues rank="b" value="0.320"/>	<!-- Bishop -->-<rankValues rank="n" value="0.267"/>	<!-- Knight -->-<rankValues rank="q" value="1"/>	<!-- Queen -->-<rankValues rank="k" value="0"/>	<!-- King -->+<rankValues rank="p" rankValue="0.093"/>	<!-- Pawn -->+<rankValues rank="r" rankValue="0.446"/>	<!-- Rook -->+<rankValues rank="b" rankValue="0.320"/>	<!-- Bishop -->+<rankValues rank="n" rankValue="0.267"/>	<!-- Knight -->+<rankValues rank="q" rankValue="1"/>		<!-- Queen -->+<rankValues rank="k" rankValue="0"/>		<!-- King -->

@@ -9,3 +9,4 @@  License: 	GNU GENERAL PUBLIC LICENSE Version 3; see '/usr/share/common-licenses/GPL-3' or '/usr/share/doc/licenses/gpl-3.0.txt' where available, or the local packaged file 'LICENSE'.+

@@ -13,61 +13,61 @@ # You should have received a copy of the GNU General Public License # along with BishBosh.  If not, see <http://www.gnu.org/licenses/>. -.PHONY: hlint test prof cabalCheck sdist findOmissions xboard duel haddock graphmod+.PHONY: cabalCheck duel findOmissions graphmod haddock hlint prof randomTest sdist test xboard  PACKAGE_NAME	= bishbosh SHELL		= /bin/bash GHC_OPTIONS	= --ghc-options='-j' BIN_DIR		= $$HOME/.local/bin/ -# Build hlint.-$(BIN_DIR)/hlint:-	@stack install hlint+$(BIN_DIR)/graphmod $(BIN_DIR)/hlint:+	@[ -x $@ ] || stack install $(suffix @) $(GHC_OPTIONS) -# Check for lint.+# Display the module-dependency graph.+graphmod: $(BIN_DIR)/graphmod+	@$@ --graph-dim='40,24' -i 'src-lib' -i 'src-exe' Main | tred | dot -Tsvg | display++# Groom sourcecode. hlint: $(BIN_DIR)/hlint-	@$@	--cpp-define 'USE_PARALLEL'\+	@$@ -j --no-exit-code\+		--cpp-define 'USE_PARALLEL'\ 		--cpp-define 'USE_POLYPARSE=1'\ 		--cpp-define 'USE_UNBOXED_ARRAYS'\+		--cpp-define 'USE_NEWTYPE_WRAPPERS'\ 		--ignore 'Use tuple-section'\-		src-lib/ +RTS -N -RTS || true-	@$@	--cpp-define 'USE_HXTRELAXNG'\+		src-lib/ +RTS -N -RTS+	@$@ -j --no-exit-code\+		--cpp-define 'USE_HXTRELAXNG'\ 		--cpp-define 'USE_PARALLEL'\ 		--cpp-define 'USE_UNBOXED_ARRAYS'\ 		--cpp-define 'USE_UNIX'\ 		--cpp-define 'MOVE_NOTATION=S'\ 		--ignore 'Reduce duplication'\-		src-exe/ +RTS -N -RTS || true-	@$@	--cpp-define 'USE_PARALLEL'\+		src-exe/ +RTS -N -RTS+	@$@ -j 	--cpp-define 'USE_PARALLEL'\ 		--cpp-define 'USE_POLYPARSE=1'\ 		--cpp-define 'USE_SEARCH'\ 		--ignore 'Use tuple-section'\ 		src-test/ +RTS -N -RTS -# Compile with various CPP-flags & run the test-suites.+# Serially compile with various CPP-flags & run the test-suites. test:-	@for FLAG in -narrownumbers -polyparse -hxtrelaxng narrownumbers -threaded unboxedarrays; do\+	@for FLAG in -polyparse newtypewrappers -hxtrelaxng narrownumbers unboxedarrays -threaded; do\ 		echo $${FLAG};\ 		stack '$@' --flag="$(PACKAGE_NAME):$${FLAG}" $(GHC_OPTIONS) || break;\ 	done +# Compile with random CPP-flags & run the test-suites.+randomTest:+	@FLAGS=$$(shuf --echo -- hxtrelaxng -hxtrelaxng narrownumbers -narrownumbers newtypewrappers -newtypewrappers polyparse -polyparse threaded -threaded unboxedarrays -unboxedarrays | head --lines=3 | sed -e 's/\(.*\)/--flag=$(PACKAGE_NAME):\1/');\+	echo $$FLAGS;\+	stack test $${FLAGS} $(GHC_OPTIONS)+ # Profile. prof: 	@stack install --library-profiling --executable-profiling $(GHC_OPTIONS) 	@$(PACKAGE_NAME) -i 'config/Raw/$(PACKAGE_NAME)_$@.xml' +RTS -p -N2 -RTS -# Check the cabal-file.-cabalCheck:-	@cabal check--# Package for upload to Hackage.-sdist:-	@cabal '$@'--# Find source-files missing from the distribution.-findOmissions: sdist-	@diff <(find src-* -type f \( -name '*.hs' -a ! -name 'Setup.hs' \) | sed 's!^\./!!' | sort) <(tar -ztf dist*/sdist/$(PACKAGE_NAME)-*.tar.gz | grep '\.hs$$' | sed 's!^$(PACKAGE_NAME)-[0-9.]*/!!' | sort)- # Install this product. $(BIN_DIR)/$(PACKAGE_NAME) $(BIN_DIR)/duel: 	@stack install $(GHC_OPTIONS)@@ -78,13 +78,21 @@  # Start a battle. duel: $(BIN_DIR)/duel-	@$@ --verbosity='Verbose' --nGames=128 --readTimeout=30 -i 'config/Raw/bishbosh_$@_white.xml' -i 'config/Raw/bishbosh_$@_black.xml'+	@$@ --nGames=32 --verbosity='Verbose' -i 'config/Raw/$(PACKAGE_NAME)_$@_white.xml' -i 'config/Raw/$(PACKAGE_NAME)_$@_black.xml'  # Build the source-code documentation. haddock: 	@stack '$@' --no-$@-deps $(GHC_OPTIONS) -# Show module-dependency graph.-graphmod:-	@$@ --graph-dim='40,24' -i 'src-exe' -i 'src-lib' Main | tred | dot -Tsvg | display	# CAVEAT: doesn't include 'Duel'.+# Package for upload to Hackage.+sdist:+	@cabal '$@'++# Check the cabal-file.+cabalCheck:+	@cabal check++# Find source-files missing from the distribution.+findOmissions: sdist+	@diff <(find src-* -type f -name '*.hs' | sed 's!^\./!!' | sort) <(tar -ztf dist*/sdist/$(PACKAGE_NAME)-*.tar.gz | grep '\.hs$$' | grep -v 'Setup.hs' | sed 's!^$(PACKAGE_NAME)-[0-9.]*/!!' | sort) 

@@ -7,7 +7,8 @@ .PP An application which automatically plays chess, by forking two independently configured instances of \fBbishbosh\fR. One instance automates the moves of White & the other automates the moves of Black.-This application merely acts as an intermediary, passing moves between these instances to synchronise their positions, while collating the game-results to permit comparison of the fitness of their respective configurations.+This application merely acts as an intermediary, passing moves between these instances to synchronise their positions,+while measuring the total time taken by either side & collating the game-results to permit comparison of the fitness of their respective configurations. .PP This process facilitates optimisation of the complex configuration of \fBbishbosh\fR. .SH OPTIONS@@ -15,21 +16,32 @@ \fB--verbosity=\fR(\fBSilent\fR|\fBNormal\fR|\fBVerbose\fR|\fBDeafening\fR), defaulting to "\fBNormal\fR". Defines the quantity of ancillary output required. .TP+\fB-d\fR \fIInt\fR, \fB--nDecimalDigits=\fR\fIInt\fR, defaulting to "\fB0\fR".+The precision with which to display the total time taken by each side.+.TP \fB-n\fR \fIInt\fR, \fB--nGames=\fR\fIInt\fR, defaulting to "\fB1\fR". The number of games to be played before presenting the results. .TP \fB-t\fR \fIInt\fR, \fB--readTimeout=\fR\fIInt\fR, defaulting to \fIindefinitely\fR.-The number of seconds to wait for a move before aborting.-CAVEAT: the period typically required depends on;+The maximum number of seconds to wait for one of the forked processes to return a move, before aborting.+CAVEAT: the required period typically required depends on; .IP \(bu the machine's speed, .IP \(bu what else is running on the machine, .IP \(bu-the search-depth,+the size of the machine's RAM, .IP \(bu-the fitness-evaluation criteria.+the time initially required to process any PGN-database,+.IP \(bu+\fBbishbosh\fR's configuration (e.g. search-depth or fitness-evaluation criteria). .TP+.B --verifyConfiguration+Verify the mutual compatibility of the two configuration-files before forwarding each to a forked instance of \fBbishbosh\fR,+where the syntactic & semantic correctness will be independently verified.+The configurations are required to define the same move-notation & to define the logical colour of the automated player in the correct order to avoid deadlock.+N.B. since verification of this compatibility-requirement necessitates parsing, syntactic-verification is an inevitable side-effect.+.TP \fB-i\fR \fIFile-path\fR, \fB--appendInputConfigFilePath=\fR\fIFile-path\fR; there is no default. Define the path to a configuration-file to forward to \fBbishbosh\fR. Two such paths are required, the first will be passed to the instance playing White & the second to the instance playing Black.@@ -44,20 +56,22 @@ \fB0\fR on success, & >\fB0\fR if an error occurs. .SH EXAMPLES .nf-.B duel --verbosity='Verbose' --nGames=128 -i 'config/Raw/bishbosh_duel_white.xml' -i 'config/Raw/bishbosh_duel_black.xml'+.B duel --nGames=32 --verbosity='Verbose' --verifyConfiguration -i 'config/Raw/bishbosh_duel_white.xml' -i 'config/Raw/bishbosh_duel_black.xml' .fi .IP \(bu The application has been instructed to provide a relatively large amount of feedback. .IP \(bu-Two packaged configuration-files have been referenced, the first referring to the instance playing White, as required.+Two packaged configuration-files have been referenced. .IP \(bu+The compatibility of the configuration-files is verified to confirm that they automate White & Black respectively, & that they use the same move-notation.+.IP \(bu CAVEAT: assumes that the executable exists on \fB$PATH\fR, otherwise an explicit path will be required. .PP .nf .B make duel .fi .IP \(bu-The same as above.+Much the same as the previous example, but verification is unnecessary since the configuration-files are hard-coded. .IP \(bu The current working directory must be \fBbishbosh\fR's installation-directory where the required \fBmakefile\fR is defined. .SH FILES@@ -74,8 +88,6 @@ .SH AUTHOR Written by Dr. Alistair Ward. .SH BUGS-.IP \(bu-The comparison between the configurations of the two instances doesn't factor the time taken by each instance. .SS "REPORTING BUGS" Report bugs to "\fBbishbosh@functionalley.com\fR". .SH COPYRIGHT

@@ -91,3 +91,4 @@  ) ( 	const $ return {-to IO-monad-} "purging MVar."  )+

@@ -38,7 +38,7 @@ 	play  ) where -import			Control.Arrow((&&&))+import			Control.Arrow((&&&), (|||)) import qualified	BishBosh.Component.Zobrist					as Component.Zobrist import qualified	BishBosh.ContextualNotation.PositionHashQualifiedMoveTree	as ContextualNotation.PositionHashQualifiedMoveTree import qualified	BishBosh.ContextualNotation.QualifiedMoveForest			as ContextualNotation.QualifiedMoveForest@@ -54,7 +54,9 @@ import qualified	BishBosh.Search.SearchState					as Search.SearchState import qualified	BishBosh.State.PlayState					as State.PlayState import qualified	BishBosh.Text.ShowColouredPrefix				as Text.ShowColouredPrefix-import qualified	BishBosh.Types							as T+import qualified	BishBosh.Type.Crypto						as Type.Crypto+import qualified	BishBosh.Type.Length						as Type.Length+import qualified	BishBosh.Type.Mass						as Type.Mass import qualified	BishBosh.UI.CECP						as UI.CECP import qualified	BishBosh.UI.Raw							as UI.Raw import qualified	Control.DeepSeq@@ -74,15 +76,7 @@  -- | Plays the game according to the specified configuration. play :: (-	Control.DeepSeq.NFData					column,-#ifdef USE_PARALLEL-	Control.DeepSeq.NFData					criterionValue,-#endif-	Control.DeepSeq.NFData					criterionWeight, 	Control.DeepSeq.NFData					pieceSquareValue,-	Control.DeepSeq.NFData					rankValue,-	Control.DeepSeq.NFData					row,-	Control.DeepSeq.NFData					weightedMean, 	Control.DeepSeq.NFData					x, 	Control.DeepSeq.NFData					y, 	Data.Array.IArray.Ix					x,@@ -90,45 +84,29 @@ 	Data.Array.Unboxed.IArray Data.Array.Unboxed.UArray	pieceSquareValue,	-- Requires 'FlexibleContexts'. The unboxed representation of the array-element must be defined (& therefore must be of fixed size). #endif 	Data.Bits.FiniteBits					positionHash,-	Fractional						criterionValue, 	Fractional						pieceSquareValue,-	Fractional						rankValue,-	Fractional						weightedMean,-	Integral						column, 	Integral						x, 	Integral						y, 	Ord							positionHash, 	Read							x, 	Read							y,-	Real							criterionValue,-	Real							criterionWeight, 	Real							pieceSquareValue,-	Real							rankValue,-	Real							weightedMean,-	Show							column, 	Show							pieceSquareValue,-	Show							row, 	Show							x, 	Show							y, 	System.Random.Random					positionHash, 	System.Random.RandomGen					randomGen  ) 	=> randomGen-	-> Input.Options.Options column criterionWeight pieceSquareValue rankValue row x y+	-> Input.Options.Options pieceSquareValue x y 	-> ContextualNotation.QualifiedMoveForest.QualifiedMoveForest x y	-- ^ Standard openings.-	-> IO (State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y)-{-# SPECIALISE play :: (-	Control.DeepSeq.NFData	column,-	Control.DeepSeq.NFData	row,-	Integral		column,-	Show			column,-	Show			row,-	System.Random.RandomGen	randomGen- )+	-> IO (State.PlayState.PlayState pieceSquareValue positionHash x y)+{-# SPECIALISE play+	:: System.Random.RandomGen randomGen 	=> randomGen-	-> Input.Options.Options column T.CriterionWeight T.PieceSquareValue T.RankValue row T.X T.Y-	-> ContextualNotation.QualifiedMoveForest.QualifiedMoveForest T.X T.Y-	-> IO (State.PlayState.PlayState column T.CriterionValue T.CriterionWeight T.PieceSquareValue T.PositionHash T.RankValue row T.WeightedMean T.X T.Y)+	-> Input.Options.Options Type.Mass.PieceSquareValue Type.Length.X Type.Length.Y+	-> ContextualNotation.QualifiedMoveForest.QualifiedMoveForest Type.Length.X Type.Length.Y+	-> IO (State.PlayState.PlayState Type.Mass.PieceSquareValue Type.Crypto.PositionHash Type.Length.X Type.Length.Y)  #-} play randomGen options qualifiedMoveForest	= Data.Maybe.maybe ( 	return {-to IO-monad-} Data.Default.def {-game-}@@ -169,7 +147,7 @@ 			else Property.Empty.empty {-MoveFrequency-} 	)  ) >>= (-	const UI.Raw.takeTurns `either` const UI.CECP.takeTurns $ Input.UIOptions.getEitherNativeUIOrCECPOptions uiOptions	-- Select a user-interface.+	const UI.Raw.takeTurns ||| const UI.CECP.takeTurns $ Input.UIOptions.getEitherNativeUIOrCECPOptions uiOptions	-- Select a user-interface.  ) ( 	ContextualNotation.PositionHashQualifiedMoveTree.fromQualifiedMoveForest ( 		Input.EvaluationOptions.getIncrementalEvaluation $ Input.Options.getEvaluationOptions options

@@ -40,8 +40,8 @@ 	| MaximumPlies	-- ^ The configured maximum number of /turn/s has been reached.  instance Show ApplicationTerminationReason where-	showsPrec _ ByRequest		= showString "by request"-	showsPrec _ MaximumPlies	= showString "because the configured maximum number of plies has been reached"+	show ByRequest		= "by request"+	show MaximumPlies	= "because the configured maximum number of plies has been reached"  instance Control.DeepSeq.NFData ApplicationTerminationReason where 	rnf _	= ()

@@ -65,13 +65,16 @@ import qualified	BishBosh.Input.IOOptions				as Input.IOOptions import qualified	BishBosh.Input.Options					as Input.Options import qualified	BishBosh.Input.UIOptions				as Input.UIOptions+import qualified	BishBosh.Metric.CriterionValue				as Metric.CriterionValue import qualified	BishBosh.Model.Game					as Model.Game import qualified	BishBosh.Model.GameTree					as Model.GameTree import qualified	BishBosh.Notation.MoveNotation				as Notation.MoveNotation import qualified	BishBosh.Search.SearchState				as Search.SearchState import qualified	BishBosh.State.ApplicationTerminationReason		as State.ApplicationTerminationReason import qualified	BishBosh.State.TurnsByLogicalColour			as State.TurnsByLogicalColour-import qualified	BishBosh.Types						as T+import qualified	BishBosh.Type.Crypto					as Type.Crypto+import qualified	BishBosh.Type.Length					as Type.Length+import qualified	BishBosh.Type.Mass					as Type.Mass import qualified	Control.Exception import qualified	Data.Array.IArray import qualified	Data.Bits@@ -81,58 +84,45 @@ import qualified	Data.Ord import qualified	Factory.Math.Statistics -#ifdef USE_PARALLEL-import qualified	Control.DeepSeq-#endif- #ifdef USE_UNBOXED_ARRAYS import qualified	Data.Array.Unboxed #endif  -- | The type threaded through the sequence of /game/s during play.-data PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y	= MkPlayState {-	getCriterionValues			:: [[criterionValue]],									-- ^ The /criterion-value/s accumulated during the game.-	getZobrist				:: Component.Zobrist.Zobrist x y positionHash,						-- ^ The constant hash-codes used construct position-hashes.-	getMoveFrequency			:: Model.GameTree.MoveFrequency x y,							-- ^ The constant frequency of moves extracted from file.-	getSearchState				:: Search.SearchState.SearchState x y positionHash criterionValue weightedMean,-	getOptions				:: Input.Options.Options column criterionWeight pieceSquareValue rankValue row x y,	-- ^ The constant options by which the game is configured.-	getMaybeApplicationTerminationReason	:: Maybe State.ApplicationTerminationReason.ApplicationTerminationReason		-- ^ Whether the game has terminated.+data PlayState pieceSquareValue positionHash x y	= MkPlayState {+	getCriterionValues			:: [[Metric.CriterionValue.CriterionValue]],					-- ^ The /criterion-value/s accumulated during the game.+	getZobrist				:: Component.Zobrist.Zobrist x y positionHash,					-- ^ The constant hash-codes used construct position-hashes.+	getMoveFrequency			:: Model.GameTree.MoveFrequency x y,						-- ^ The constant frequency of moves extracted from file.+	getSearchState				:: Search.SearchState.SearchState x y positionHash,+	getOptions				:: Input.Options.Options pieceSquareValue x y,					-- ^ The constant options by which the game is configured.+	getMaybeApplicationTerminationReason	:: Maybe State.ApplicationTerminationReason.ApplicationTerminationReason	-- ^ Whether the game has terminated. }  -- | Constructor. initialise :: (-#ifdef USE_PARALLEL-	Control.DeepSeq.NFData					criterionValue,-#endif 	Data.Array.IArray.Ix					x, #ifdef USE_UNBOXED_ARRAYS 	Data.Array.Unboxed.IArray Data.Array.Unboxed.UArray	pieceSquareValue,	-- Requires 'FlexibleContexts'. The unboxed representation of the array-element must be defined (& therefore must be of fixed size). #endif 	Data.Bits.Bits						positionHash,-	Fractional						criterionValue, 	Fractional						pieceSquareValue,-	Fractional						rankValue,-	Fractional						weightedMean, 	Integral						x, 	Integral						y,-	Real							criterionValue,-	Real							criterionWeight, 	Real							pieceSquareValue,-	Real							rankValue, 	Show							x, 	Show							y  )-	=> Input.Options.Options column criterionWeight pieceSquareValue rankValue row x y+	=> Input.Options.Options pieceSquareValue x y 	-> Component.Zobrist.Zobrist x y positionHash 	-> Model.GameTree.MoveFrequency x y 	-> Model.Game.Game x y-	-> PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y+	-> PlayState pieceSquareValue positionHash x y {-# SPECIALISE initialise-	:: Input.Options.Options column T.CriterionWeight T.PieceSquareValue T.RankValue row T.X T.Y-	-> Component.Zobrist.Zobrist T.X T.Y T.PositionHash-	-> Model.GameTree.MoveFrequency T.X T.Y-	-> Model.Game.Game T.X T.Y-	-> PlayState column T.CriterionValue T.CriterionWeight T.PieceSquareValue T.PositionHash T.RankValue row T.WeightedMean T.X T.Y+	:: Input.Options.Options Type.Mass.PieceSquareValue Type.Length.X Type.Length.Y+	-> Component.Zobrist.Zobrist Type.Length.X Type.Length.Y Type.Crypto.PositionHash+	-> Model.GameTree.MoveFrequency Type.Length.X Type.Length.Y+	-> Model.Game.Game Type.Length.X Type.Length.Y+	-> PlayState Type.Mass.PieceSquareValue Type.Crypto.PositionHash Type.Length.X Type.Length.Y  #-} initialise options zobrist moveFrequency game	= MkPlayState { 	getCriterionValues			= [],@@ -146,41 +136,32 @@ }  -- | Accessor.-getGame :: PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y -> Model.Game.Game x y+getGame :: PlayState pieceSquareValue positionHash x y -> Model.Game.Game x y getGame MkPlayState { getSearchState = searchState }	= Evaluation.QuantifiedGame.getGame . Evaluation.PositionHashQuantifiedGameTree.getRootQuantifiedGame $ Search.SearchState.getPositionHashQuantifiedGameTree searchState  -- | The type of a function used to transform a 'PlayState'.-type Transformation column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y	= PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y -> PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y+type Transformation pieceSquareValue positionHash x y	= PlayState pieceSquareValue positionHash x y -> PlayState pieceSquareValue positionHash x y  -- | Mutator.-setPositionHashQuantifiedGameTree :: Evaluation.PositionHashQuantifiedGameTree.PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean -> Transformation column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y+setPositionHashQuantifiedGameTree :: Evaluation.PositionHashQuantifiedGameTree.PositionHashQuantifiedGameTree x y positionHash -> Transformation pieceSquareValue positionHash x y setPositionHashQuantifiedGameTree positionHashQuantifiedGameTree playState@MkPlayState { getSearchState = searchState }	= playState { 	getSearchState	= searchState { Search.SearchState.getPositionHashQuantifiedGameTree = positionHashQuantifiedGameTree } }  -- | Reconstruct the /positionHashQuantifiedGameTree/ (in the /searchState/), with the apex set to the specified game. reconstructPositionHashQuantifiedGameTree :: (-#ifdef USE_PARALLEL-	Control.DeepSeq.NFData					criterionValue,-#endif 	Data.Array.IArray.Ix					x, #ifdef USE_UNBOXED_ARRAYS 	Data.Array.Unboxed.IArray Data.Array.Unboxed.UArray	pieceSquareValue,	-- Requires 'FlexibleContexts'. The unboxed representation of the array-element must be defined (& therefore must be of fixed size). #endif 	Data.Bits.Bits						positionHash,-	Fractional						criterionValue, 	Fractional						pieceSquareValue,-	Fractional						rankValue,-	Fractional						weightedMean, 	Integral						x, 	Integral						y,-	Real							criterionValue,-	Real							criterionWeight, 	Real							pieceSquareValue,-	Real							rankValue, 	Show							x, 	Show							y- ) => Model.Game.Game x y -> Transformation column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y+ ) => Model.Game.Game x y -> Transformation pieceSquareValue positionHash x y reconstructPositionHashQuantifiedGameTree game playState@MkPlayState { 	getZobrist		= zobrist, 	getMoveFrequency	= moveFrequency,@@ -193,27 +174,18 @@  -- | Reset to the initial state. resetPositionHashQuantifiedGameTree :: (-#ifdef USE_PARALLEL-	Control.DeepSeq.NFData					criterionValue,-#endif 	Data.Array.IArray.Ix					x, #ifdef USE_UNBOXED_ARRAYS 	Data.Array.Unboxed.IArray Data.Array.Unboxed.UArray	pieceSquareValue,	-- Requires 'FlexibleContexts'. The unboxed representation of the array-element must be defined (& therefore must be of fixed size). #endif 	Data.Bits.Bits						positionHash,-	Fractional						criterionValue, 	Fractional						pieceSquareValue,-	Fractional						rankValue,-	Fractional						weightedMean, 	Integral						x, 	Integral						y,-	Real							criterionValue,-	Real							criterionWeight, 	Real							pieceSquareValue,-	Real							rankValue, 	Show							x, 	Show							y- ) => Transformation column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y+ ) => Transformation pieceSquareValue positionHash x y resetPositionHashQuantifiedGameTree playState	= reconstructPositionHashQuantifiedGameTree Data.Default.def playState { 	getCriterionValues			= [], 	getMaybeApplicationTerminationReason	= Nothing@@ -221,19 +193,16 @@  -- | Mutator. updateWithAutomaticMove-	:: [criterionValue]-	-> Search.SearchState.SearchState x y positionHash criterionValue weightedMean-	-> Transformation column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y+	:: [Metric.CriterionValue.CriterionValue]+	-> Search.SearchState.SearchState x y positionHash+	-> Transformation pieceSquareValue positionHash x y updateWithAutomaticMove criterionValues searchState playState	= playState { 	getCriterionValues	= criterionValues : getCriterionValues playState, 	getSearchState		= searchState }  -- | Mutator.-updateWithManualMove :: (-	Eq	x,-	Eq	y- ) => Model.Game.Game x y -> Transformation column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y+updateWithManualMove :: (Eq x, Eq y) => Model.Game.Game x y -> Transformation pieceSquareValue positionHash x y updateWithManualMove game playState@MkPlayState { getSearchState = searchState }	= setPositionHashQuantifiedGameTree ( 	Data.Maybe.fromMaybe ( 		Control.Exception.throw $ Data.Exception.mkIncompatibleData "BishBosh.State.PlayState.updateWithManualMove:\tEvaluation.PositionHashQuantifiedGameTree.reduce failed."@@ -251,15 +220,20 @@ -- | Calculate the /root-mean-square/ & the /standard-deviation/, of the values of each type of /criterion/. calculateCriterionValueStatistics :: ( 	Floating	standardDeviation,-	Fractional	mean,-	Real		criterionValue- ) => PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y -> [(mean, standardDeviation)]+	Fractional	mean+ )+	=> PlayState pieceSquareValue positionHash x y+	-> [(mean, standardDeviation)] calculateCriterionValueStatistics MkPlayState { getCriterionValues = criterionValues }	= map (-	Factory.Math.Statistics.getMean &&& Factory.Math.Statistics.getStandardDeviation+	(+		Factory.Math.Statistics.getMean &&& Factory.Math.Statistics.getStandardDeviation+	) . map (+		\criterionValue -> realToFrac criterionValue	:: Type.Mass.CriterionValue+	)  ) $ Data.List.transpose criterionValues  -- | Resignation by the player who currently holds the choice of move.-resign :: Transformation column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y+resign :: Transformation pieceSquareValue positionHash x y resign playState@MkPlayState { getSearchState = searchState }	= setPositionHashQuantifiedGameTree ( 	Evaluation.PositionHashQuantifiedGameTree.resign $ Search.SearchState.getPositionHashQuantifiedGameTree searchState  ) playState@@ -274,7 +248,7 @@ 	Show	y  ) 	=> String	-- ^ Move-string.-	-> PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y+	-> PlayState pieceSquareValue positionHash x y 	-> [String]	-- ^ Suggested corrections. suggestCorrections moveString playState@MkPlayState { getOptions = options } 	| Model.Game.isTerminated game	= []@@ -286,11 +260,12 @@  -- | Whether the game in the first /play-state/ has more plies than that in the second. hasMorePlies-	:: PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y-	-> PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y+	:: PlayState pieceSquareValue positionHash x y+	-> PlayState pieceSquareValue positionHash x y 	-> Bool hasMorePlies playState playState'	= Data.Ord.comparing (State.TurnsByLogicalColour.getNPlies . Model.Game.getTurnsByLogicalColour . getGame) playState playState' == GT  -- | Whether the user has requested application-termination, or the configured maximum number of turns has been reached.-hasApplicationTerminationBeenRequested :: PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y -> Bool+hasApplicationTerminationBeenRequested :: PlayState pieceSquareValue positionHash x y -> Bool hasApplicationTerminationBeenRequested MkPlayState { getMaybeApplicationTerminationReason = maybeApplicationTerminationReason }	= Data.Maybe.isJust maybeApplicationTerminationReason+

@@ -43,11 +43,9 @@ 	takeTurns  ) where -import			Control.Arrow((&&&))+import			Control.Arrow((&&&), (|||)) import			Control.Monad((>=>)) import qualified	BishBosh.Attribute.Rank						as Attribute.Rank-import qualified	BishBosh.Attribute.RankValues					as Attribute.RankValues-import qualified	BishBosh.Attribute.WeightedMeanAndCriterionValues		as Attribute.WeightedMeanAndCriterionValues import qualified	BishBosh.Component.Move						as Component.Move import qualified	BishBosh.Component.QualifiedMove				as Component.QualifiedMove import qualified	BishBosh.Component.Turn						as Component.Turn@@ -57,7 +55,6 @@ import qualified	BishBosh.ContextualNotation.QualifiedMoveForest			as ContextualNotation.QualifiedMoveForest import qualified	BishBosh.ContextualNotation.StandardAlgebraic			as ContextualNotation.StandardAlgebraic import qualified	BishBosh.Data.Exception						as Data.Exception-import qualified	BishBosh.Data.Time						as Data.Time import qualified	BishBosh.Evaluation.Fitness					as Evaluation.Fitness import qualified	BishBosh.Evaluation.PositionHashQuantifiedGameTree		as Evaluation.PositionHashQuantifiedGameTree import qualified	BishBosh.Evaluation.QuantifiedGame				as Evaluation.QuantifiedGame@@ -66,15 +63,18 @@ import qualified	BishBosh.Input.EvaluationOptions				as Input.EvaluationOptions import qualified	BishBosh.Input.IOOptions					as Input.IOOptions import qualified	BishBosh.Input.Options						as Input.Options+import qualified	BishBosh.Input.RankValues					as Input.RankValues import qualified	BishBosh.Input.SearchOptions					as Input.SearchOptions import qualified	BishBosh.Input.StandardOpeningOptions				as Input.StandardOpeningOptions import qualified	BishBosh.Input.UIOptions					as Input.UIOptions+import qualified	BishBosh.Metric.WeightedMeanAndCriterionValues			as Metric.WeightedMeanAndCriterionValues import qualified	BishBosh.Model.Game						as Model.Game-import qualified	BishBosh.Model.GameTerminationReason				as Model.GameTerminationReason import qualified	BishBosh.Notation.MoveNotation					as Notation.MoveNotation import qualified	BishBosh.Property.ExtendedPositionDescription			as Property.ExtendedPositionDescription import qualified	BishBosh.Property.ForsythEdwards				as Property.ForsythEdwards import qualified	BishBosh.Property.ShowFloat					as Property.ShowFloat+import qualified	BishBosh.Property.Switchable					as Property.Switchable+import qualified	BishBosh.Rule.GameTerminationReason				as Rule.GameTerminationReason import qualified	BishBosh.Search.Search						as Search.Search import qualified	BishBosh.Search.SearchState					as Search.SearchState import qualified	BishBosh.State.ApplicationTerminationReason			as State.ApplicationTerminationReason@@ -82,7 +82,11 @@ import qualified	BishBosh.State.PlayState					as State.PlayState import qualified	BishBosh.Text.ShowList						as Text.ShowList import qualified	BishBosh.Text.ShowPrefix					as Text.ShowPrefix-import qualified	BishBosh.Types							as T+import qualified	BishBosh.Time.StopWatch						as Time.StopWatch+import qualified	BishBosh.Type.Count						as Type.Count+import qualified	BishBosh.Type.Crypto						as Type.Crypto+import qualified	BishBosh.Type.Length						as Type.Length+import qualified	BishBosh.Type.Mass						as Type.Mass import qualified	BishBosh.UI.Command						as UI.Command import qualified	BishBosh.UI.PrintObject						as UI.PrintObject import qualified	BishBosh.UI.ReportObject					as UI.ReportObject@@ -99,8 +103,6 @@ import qualified	Data.List.Extra import qualified	Data.Map import qualified	Data.Maybe-import qualified	Data.Time.Clock-import qualified	Numeric import qualified	System.IO import qualified	System.Random import qualified	ToolShed.System.Random@@ -111,23 +113,23 @@  -- | Used in output to prefix hints. hintTag :: String-hintTag			= "Hint:"+hintTag		= "Hint:"  -- | Used in output, to prefix moves. moveTag :: String-moveTag			= "move"+moveTag		= "move"  -- | Used in output, to qualify a draw-offer. offerTag :: String-offerTag		= "offer"+offerTag	= "offer"  -- | The response to a ping request. pongTag :: String-pongTag			= "pong"+pongTag		= "pong"  -- | The command used to request the version of the CECP protocol. protoverTag :: String-protoverTag		= "protover"+protoverTag	= "protover"  -- | Constant. explicitEnpassant :: ContextualNotation.StandardAlgebraic.ExplicitEnPassant@@ -164,29 +166,24 @@ mkParseFailureError :: ShowS mkParseFailureError	= mkErrorMessage "parse-failure" --- | Format thinking-output suitable to be posted to xboard.-showsThinking :: (-	Fractional	rankValue,-	Real		rankValue,-	Real		weightedMean- )-	=> Input.SearchOptions.SearchDepth-	-> Input.EvaluationOptions.EvaluationOptions criterionWeight pieceSquareValue rankValue x y-	-> weightedMean-	-> Data.Time.Clock.NominalDiffTime	-- ^ Elapsed time.-	-> Component.Move.NPlies		-- ^ Nodes searched.-	-> String				-- ^ Principal variation.+-- | Format thinking-output suitable to be posted to /xboard/.+showsThinking+	:: Property.ShowFloat.ShowFloat stoppedWatch+	=> Type.Count.NPlies		-- ^ Search-depth.+	-> Input.EvaluationOptions.EvaluationOptions pieceSquareValue x y+	-> Type.Mass.WeightedMean+	-> stoppedWatch+	-> Type.Count.NPositions	-- ^ Nodes searched.+	-> String			-- ^ Principal variation. 	-> ShowS-showsThinking searchDepth evaluationOptions weightedMean elapsedTime nPlies principalVariation	= Text.ShowList.showsDelimitedList (showChar ' ') id id [+showsThinking searchDepth evaluationOptions weightedMean stoppedWatch nPlies principalVariation	= Text.ShowList.showsDelimitedList (showChar ' ') id id [ 	shows searchDepth,-	shows . (-		round	:: Double -> Int-	) $ 100 {-centi-Pawns-} * realToFrac (+	shows . (round :: Type.Mass.RankValue -> Int) $ 100 {-centi-Pawns-} * ( 		uncurry (/) . (-			Attribute.RankValues.calculateMaximumTotalValue &&& Attribute.RankValues.findRankValue Attribute.Rank.Pawn+			Input.RankValues.calculateMaximumTotalValue &&& realToFrac . Input.RankValues.findRankValue Attribute.Rank.Pawn 		) $ Input.EvaluationOptions.getRankValues evaluationOptions 	) * realToFrac weightedMean,-	shows (round $ 100 {-centi-seconds-} * elapsedTime :: Int),+	Property.ShowFloat.showsFloat (shows . (round :: Double -> Int) . (* 100)) stoppedWatch, 	shows nPlies  ] . showChar '\t' . showString principalVariation @@ -195,15 +192,8 @@  	* Since the user can also request roll-back to an earlier game before then requesting a new move, a new game is returned rather than just the requested move. -}-readMove :: forall column criterionValue criterionWeight pieceSquareValue positionHash randomGen rankValue row weightedMean x y. (-	Control.DeepSeq.NFData					column,-#ifdef USE_PARALLEL-	Control.DeepSeq.NFData					criterionValue,-#endif-	Control.DeepSeq.NFData					criterionWeight,+readMove :: forall pieceSquareValue positionHash randomGen x y. ( 	Control.DeepSeq.NFData					pieceSquareValue,-	Control.DeepSeq.NFData					rankValue,-	Control.DeepSeq.NFData					row, 	Control.DeepSeq.NFData					x, 	Control.DeepSeq.NFData					y, 	Data.Array.IArray.Ix					x,@@ -211,45 +201,31 @@ 	Data.Array.Unboxed.IArray Data.Array.Unboxed.UArray	pieceSquareValue,	-- Requires 'FlexibleContexts'. The unboxed representation of the array-element must be defined (& therefore must be of fixed size). #endif 	Data.Bits.Bits						positionHash,-	Fractional						criterionValue, 	Fractional						pieceSquareValue,-	Fractional						rankValue,-	Fractional						weightedMean, 	Integral						x, 	Integral						y, 	Ord							positionHash,-	Real							criterionValue,-	Real							criterionWeight, 	Real							pieceSquareValue,-	Real							rankValue,-	Real							weightedMean,-	Show							column, 	Show							pieceSquareValue,-	Show							row, 	Show							x, 	Show							y, 	System.Random.RandomGen					randomGen  ) 	=> ContextualNotation.PositionHashQualifiedMoveTree.PositionHashQualifiedMoveTree x y positionHash 	-> randomGen-	-> Data.Time.Clock.UTCTime-	-> State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y-	-> IO (State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y)-{-# SPECIALISE readMove :: (-	Control.DeepSeq.NFData	column,-	Control.DeepSeq.NFData	row,-	Show			column,-	Show			row,-	System.Random.RandomGen	randomGen- )-	=> ContextualNotation.PositionHashQualifiedMoveTree.PositionHashQualifiedMoveTree T.X T.Y T.PositionHash+	-> Time.StopWatch.StopWatch+	-> State.PlayState.PlayState pieceSquareValue positionHash x y+	-> IO (State.PlayState.PlayState pieceSquareValue positionHash x y)+{-# SPECIALISE readMove+	:: System.Random.RandomGen randomGen+	=> ContextualNotation.PositionHashQualifiedMoveTree.PositionHashQualifiedMoveTree Type.Length.X Type.Length.Y Type.Crypto.PositionHash 	-> randomGen-	-> Data.Time.Clock.UTCTime-	-> State.PlayState.PlayState column T.CriterionValue T.CriterionWeight T.PieceSquareValue T.PositionHash T.RankValue row T.WeightedMean T.X T.Y-	-> IO (State.PlayState.PlayState column T.CriterionValue T.CriterionWeight T.PieceSquareValue T.PositionHash T.RankValue row T.WeightedMean T.X T.Y)+	-> Time.StopWatch.StopWatch+	-> State.PlayState.PlayState Type.Mass.PieceSquareValue Type.Crypto.PositionHash Type.Length.X Type.Length.Y+	-> IO (State.PlayState.PlayState Type.Mass.PieceSquareValue Type.Crypto.PositionHash Type.Length.X Type.Length.Y)  #-} readMove positionHashQualifiedMoveTree randomGen	= slave where-	slave startUTCTime playState	= let+	slave runningWatch playState	= let 		(game, options)			= State.PlayState.getGame &&& State.PlayState.getOptions $ playState 		(searchOptions, ioOptions)	= Input.Options.getSearchOptions &&& Input.Options.getIOOptions $ options @@ -261,13 +237,13 @@ 		moveNotation	= Input.UIOptions.getMoveNotation uiOptions 		nDecimalDigits	= Input.UIOptions.getNDecimalDigits uiOptions 		verbosity	= Input.UIOptions.getVerbosity uiOptions-	 in (-		const . Control.Exception.throwIO $ Data.Exception.mkIncompatibleData "BishBosh.UI.CECP.readMove.slave:\tunexpectedly found 'NativeUIOptions'."-	 ) `either` (+	 in const (+		Control.Exception.throwIO $ Data.Exception.mkIncompatibleData "BishBosh.UI.CECP.readMove.slave:\tunexpectedly found 'NativeUIOptions'."+	 ) ||| ( 		\cecpOptions -> let 			displaySAN	= Input.CECPOptions.getDisplaySAN cecpOptions -			onCommand :: UI.Command.Command x y -> IO (State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y)+			onCommand :: UI.Command.Command x y -> IO (State.PlayState.PlayState pieceSquareValue positionHash x y) 			onCommand UI.Command.Hint	= do 				Control.Monad.unless (Model.Game.isTerminated game) . Data.Maybe.maybe ( 					do@@ -285,7 +261,7 @@ 								) ( 									flip (ContextualNotation.StandardAlgebraic.showTurn explicitEnpassant) game 								) . Model.Game.maybeLastTurn $ Evaluation.QuantifiedGame.getGame quantifiedGame-								else Notation.MoveNotation.showNotation moveNotation $ Evaluation.QuantifiedGame.getLastTurn (quantifiedGame :: Evaluation.QuantifiedGame.QuantifiedGame x y criterionValue weightedMean)+								else Notation.MoveNotation.showNotation moveNotation $ Evaluation.QuantifiedGame.getLastTurn (quantifiedGame :: Evaluation.QuantifiedGame.QuantifiedGame x y) 							_		-> Control.Exception.throwIO . Data.Exception.mkRequestFailure . showString "BishBosh.UI.CECP.readMove.slave.onCommand:\tunexpectedly failed to find any moves; " $ shows game "."	-- CAVEAT: the game should have been terminated. 				 ) ( 					\(qualifiedMove, _) -> putStrLn . showString hintTag . showChar ' ' $ if displaySAN@@ -345,7 +321,7 @@ 				 ) ( 					\(filePath, _) -> Control.Exception.catch ( 						do-							System.IO.withFile filePath System.IO.WriteMode (`System.IO.hPrint` (Data.Default.def :: Model.Game.Game T.X T.Y))+							System.IO.withFile filePath System.IO.WriteMode (`System.IO.hPrint` (Data.Default.def :: Model.Game.Game Type.Length.X Type.Length.Y))  							Control.Monad.when (verbosity == maxBound) . System.IO.hPutStrLn System.IO.stderr . Text.ShowPrefix.showsPrefixInfo . showString "the game-state has been saved in " $ shows filePath "." 					) $ \e -> System.IO.hPutStrLn System.IO.stderr . Text.ShowPrefix.showsPrefixError $ show (e :: Control.Exception.SomeException)@@ -361,13 +337,14 @@ 					} 				} 			onCommand (UI.Command.RollBack maybeNPlies)	= let-				rollBack :: Component.Move.NPlies -> IO (State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y)+				rollBack :: Type.Count.NPlies -> IO (State.PlayState.PlayState pieceSquareValue positionHash x y) 				rollBack nPlies-					| (game', _) : _ <- drop (pred nPlies) $ Model.Game.rollBack game	= return {-to IO-monad-} $ State.PlayState.reconstructPositionHashQuantifiedGameTree game' playState-					| otherwise								= onCommand UI.Command.Restart+					| (game', _) : _ <- drop (fromIntegral $ pred nPlies) $ Model.Game.rollBack game	= return {-to IO-monad-} $ State.PlayState.reconstructPositionHashQuantifiedGameTree game' playState+					| otherwise										= onCommand UI.Command.Restart 			 in Data.Maybe.maybe ( 				let-					nPlies	= succ $ Data.Map.size searchDepthByLogicalColour	-- In fully manual play, rollback one ply, in semi-manual play rollback two plies.+					nPlies :: Type.Count.NPlies+					nPlies	= fromIntegral . succ $ Data.Map.size searchDepthByLogicalColour	-- In fully manual play, rollback one ply, in semi-manual play rollback two plies. 				in do 					Control.Monad.when (verbosity == maxBound) . System.IO.hPutStrLn System.IO.stderr . Text.ShowPrefix.showsPrefixInfo . showString "rolling-back " $ shows nPlies " plies." @@ -403,7 +380,7 @@ 					do 						Control.Monad.when (verbosity == maxBound) . System.IO.hPutStrLn System.IO.stderr . Text.ShowPrefix.showsPrefixInfo . showString "setting " $ shows setObject "." -						slave startUTCTime playState {+						slave runningWatch playState { 							State.PlayState.getOptions	= Control.DeepSeq.force $ case setObject of 								UI.SetObject.SearchDepth searchDepth	-> options { 									Input.Options.getSearchOptions	= Input.SearchOptions.setSearchDepth searchDepth $ Input.Options.getSearchOptions options@@ -420,12 +397,12 @@ 					Control.Monad.when (verbosity >= Data.Default.def) . System.IO.hPutStrLn System.IO.stderr . Text.ShowPrefix.showsPrefixWarning . showString " there aren't any " $ shows Input.SearchOptions.searchDepthTag " to swap."  					eventLoop-				| otherwise						= do+				| otherwise	= do 					Control.Monad.when (verbosity == maxBound) . System.IO.hPutStrLn System.IO.stderr . Text.ShowPrefix.showsPrefixInfo . showString "swapping " $ shows Input.SearchOptions.searchDepthTag "."  					return {-to IO-monad-} playState { State.PlayState.getOptions = Input.Options.swapSearchDepth options } -			eventLoop :: IO (State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y)+			eventLoop :: IO (State.PlayState.PlayState pieceSquareValue positionHash x y) 			eventLoop	= getLine >>= \line -> do 				Control.Monad.when (verbosity == maxBound) . System.IO.hPutStrLn System.IO.stderr . Text.ShowPrefix.showsPrefixInfo . showString "received \"" $ showString line "\"." @@ -674,13 +651,13 @@  										eventLoop 									| otherwise	-> do-										elapsedTime	<- Data.Time.measureElapsedTime startUTCTime+										stoppedWatch	<- Property.Switchable.toggle runningWatch -										Control.Monad.when (verbosity == maxBound) . System.IO.hPutStrLn System.IO.stderr . Text.ShowPrefix.showsPrefixInfo . showString "paused => stopping the clock at " $ Data.Time.showsTimeAsSeconds nDecimalDigits elapsedTime "."+										Control.Monad.when (verbosity == maxBound) . System.IO.hPutStrLn System.IO.stderr . Text.ShowPrefix.showsPrefixInfo . showString "paused => stopping the watch at " $ Property.ShowFloat.showsFloatToN nDecimalDigits stoppedWatch "s."  										return {-to IO-monad-} playState { 											State.PlayState.getOptions	= Input.Options.setEitherNativeUIOrCECPOptions (-												Right cecpOptions { Input.CECPOptions.getMaybePaused = Just elapsedTime }+												Right $ Input.CECPOptions.pause stoppedWatch cecpOptions 											) options 										} 								"playother"@@ -705,16 +682,14 @@ 											) options 										} 								"resume"-									| Just timeTaken <- maybePaused	-> do-										startUTCTime'	<- Data.Time.Clock.getCurrentTime+									| Just stoppedWatch <- maybePaused	-> do+										Control.Monad.when (verbosity == maxBound) . System.IO.hPutStrLn System.IO.stderr $ Text.ShowPrefix.showsPrefixInfo "resuming => restarting the watch." -										Control.Monad.when (verbosity == maxBound) . System.IO.hPutStrLn System.IO.stderr $ Text.ShowPrefix.showsPrefixInfo "resuming => restarting the clock."+										runningWatch'	<- Property.Switchable.toggle stoppedWatch -										slave (-											Data.Time.Clock.addUTCTime (negate timeTaken) startUTCTime'	-- Restart the clock.-										 ) playState {+										slave runningWatch' playState { 											State.PlayState.getOptions	= Input.Options.setEitherNativeUIOrCECPOptions (-												Right cecpOptions { Input.CECPOptions.getMaybePaused = Nothing }+												Right $ Input.CECPOptions.resume cecpOptions 											) options 										} 									| otherwise		-> do@@ -922,7 +897,7 @@ 										| Just value	<- featureName `lookup` Input.CECPFeatures.getFeatures cecpFeatures	-> do 											Control.Monad.when (verbosity >= Data.Default.def) . System.IO.hPutStrLn System.IO.stderr . Text.ShowPrefix.showsPrefixWarning . showString Input.CECPFeatures.featureTag . Text.ShowList.showsAssociation $ shows arg' " rejected." -											slave startUTCTime playState {+											slave runningWatch playState { 												State.PlayState.getOptions	= either ( 													\i -> if i /= 0 														then \options' -> options' {@@ -940,7 +915,7 @@ 									[(featureName, stringArg)]	-> do 										Control.Monad.when (verbosity >= Data.Default.def) . System.IO.hPutStrLn System.IO.stderr . Text.ShowPrefix.showsPrefixWarning . showString Input.CECPFeatures.featureTag . Text.ShowList.showsAssociation $ shows arg' " rejected because of syntax." -										slave startUTCTime playState {+										slave runningWatch playState { 											State.PlayState.getOptions	= options { 												Input.Options.getIOOptions	= Input.IOOptions.deleteCECPFeature ( 													featureName,@@ -1014,7 +989,7 @@  					maybePaused	= Input.CECPOptions.getMaybePaused cecpOptions -					moveCommand :: String -> IO (State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y)+					moveCommand :: String -> IO (State.PlayState.PlayState pieceSquareValue positionHash x y) 					moveCommand moveString	= case Notation.MoveNotation.readsQualifiedMove moveNotation moveString of 						[(eitherQualifiedMove, "")] 							| Just errorMessage <- Model.Game.validateEitherQualifiedMove eitherQualifiedMove game	-> do@@ -1024,9 +999,7 @@  								eventLoop	-- Recurse. 							| otherwise	-> do-								elapsedTime	<- if forceMode-									then return {-to IO-monad-} 0-									else Data.Time.measureElapsedTime startUTCTime+								stoppedWatch	<- Property.Switchable.toggle runningWatch  								let 									game'		= Model.Game.applyEitherQualifiedMove eitherQualifiedMove game@@ -1037,7 +1010,7 @@ 										Notation.MoveNotation.showNotation moveNotation . Data.Maybe.fromMaybe ( 											Control.Exception.throw $ Data.Exception.mkResultUndefined "BishBosh.UI.CECP.readMove.onCommand.moveCommand:\tModel.Game.maybeLastTurn failed." 										) $ Model.Game.maybeLastTurn game'-									 ) . showString " was requested after " $ Data.Time.showsTimeAsSeconds nDecimalDigits elapsedTime "."+									 ) . showString " was requested after " $ Property.ShowFloat.showsFloatToN nDecimalDigits stoppedWatch "s."  									case ContextualNotation.PositionHashQualifiedMoveTree.findNextOnymousQualifiedMovesForPosition game' positionHashQualifiedMoveTree of 										[]			-> return ()@@ -1066,16 +1039,8 @@ 	 ) $ Input.UIOptions.getEitherNativeUIOrCECPOptions uiOptions  -- | Plays the game.-takeTurns :: forall column criterionValue criterionWeight pieceSquareValue positionHash randomGen rankValue row weightedMean x y. (-	Control.DeepSeq.NFData					column,-#ifdef USE_PARALLEL-	Control.DeepSeq.NFData					criterionValue,-#endif-	Control.DeepSeq.NFData					criterionWeight,+takeTurns :: forall pieceSquareValue positionHash randomGen x y. ( 	Control.DeepSeq.NFData					pieceSquareValue,-	Control.DeepSeq.NFData					rankValue,-	Control.DeepSeq.NFData					row,-	Control.DeepSeq.NFData					weightedMean, 	Control.DeepSeq.NFData					x, 	Control.DeepSeq.NFData					y, 	Data.Array.IArray.Ix					x,@@ -1083,40 +1048,26 @@ 	Data.Array.Unboxed.IArray Data.Array.Unboxed.UArray	pieceSquareValue,	-- Requires 'FlexibleContexts'. The unboxed representation of the array-element must be defined (& therefore must be of fixed size). #endif 	Data.Bits.Bits						positionHash,-	Fractional						criterionValue, 	Fractional						pieceSquareValue,-	Fractional						rankValue,-	Fractional						weightedMean, 	Integral						x, 	Integral						y, 	Ord							positionHash,-	Real							criterionValue,-	Real							criterionWeight, 	Real							pieceSquareValue,-	Real							rankValue,-	Real							weightedMean,-	Show							column, 	Show							pieceSquareValue,-	Show							row, 	Show							x, 	Show							y, 	System.Random.RandomGen					randomGen  ) 	=> ContextualNotation.PositionHashQualifiedMoveTree.PositionHashQualifiedMoveTree x y positionHash 	-> randomGen-	-> State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y-	-> IO (State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y)-{-# SPECIALISE takeTurns :: (-	Control.DeepSeq.NFData	column,-	Control.DeepSeq.NFData	row,-	Show			column,-	Show			row,-	System.Random.RandomGen	randomGen- )-	=> ContextualNotation.PositionHashQualifiedMoveTree.PositionHashQualifiedMoveTree T.X T.Y T.PositionHash+	-> State.PlayState.PlayState pieceSquareValue positionHash x y+	-> IO (State.PlayState.PlayState pieceSquareValue positionHash x y)+{-# SPECIALISE takeTurns+	:: System.Random.RandomGen randomGen+	=> ContextualNotation.PositionHashQualifiedMoveTree.PositionHashQualifiedMoveTree Type.Length.X Type.Length.Y Type.Crypto.PositionHash 	-> randomGen-	-> State.PlayState.PlayState column T.CriterionValue T.CriterionWeight T.PieceSquareValue T.PositionHash T.RankValue row T.WeightedMean T.X T.Y-	-> IO (State.PlayState.PlayState column T.CriterionValue T.CriterionWeight T.PieceSquareValue T.PositionHash T.RankValue row T.WeightedMean T.X T.Y)+	-> State.PlayState.PlayState Type.Mass.PieceSquareValue Type.Crypto.PositionHash Type.Length.X Type.Length.Y+	-> IO (State.PlayState.PlayState Type.Mass.PieceSquareValue Type.Crypto.PositionHash Type.Length.X Type.Length.Y)  #-} takeTurns positionHashQualifiedMoveTree randomGen playState	= do 	mVar	<- Control.Concurrent.newEmptyMVar@@ -1136,24 +1087,24 @@  		slave 			:: Maybe (Concurrent.Pondering.Pondering (Component.Move.Move x y))-			-> Maybe Component.Move.NPlies+			-> Maybe Type.Count.NPlies 			-> [randomGen]-			-> State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y-			-> IO (State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y)+			-> State.PlayState.PlayState pieceSquareValue positionHash x y+			-> IO (State.PlayState.PlayState pieceSquareValue positionHash x y) 		slave maybePondering maybeMaximumPlies ~(randomGen' : randomGens) playState'	= let 			(game', (searchOptions', uiOptions'))	= State.PlayState.getGame &&& (Input.Options.getSearchOptions &&& Input.IOOptions.getUIOptions . Input.Options.getIOOptions) . State.PlayState.getOptions $ playState'	-- Deconstruct.-			(ponderMode, isPostMode)		= either (-				const . Control.Exception.throw $ Data.Exception.mkIncompatibleData "BishBosh.UI.CECP.takeTurns.slave:\tunexpectedly found 'NativeUIOptions'."-			 ) (+			(ponderMode, isPostMode)		= const (+				Control.Exception.throw $ Data.Exception.mkIncompatibleData "BishBosh.UI.CECP.takeTurns.slave:\tunexpectedly found 'NativeUIOptions'."+			 ) ||| ( 				Input.CECPOptions.getPonderMode &&& Input.CECPOptions.getPostMode 			 ) $ Input.UIOptions.getEitherNativeUIOrCECPOptions uiOptions' 		 in Data.Maybe.maybe ( 			do-				startUTCTime	<- Data.Time.Clock.getCurrentTime+				runningWatch	<- Property.Switchable.on  				Data.Maybe.maybe ( 					do-						playState''	<- readMove positionHashQualifiedMoveTree randomGen' startUTCTime playState'	-- Read the user's command or move.+						playState''	<- readMove positionHashQualifiedMoveTree randomGen' runningWatch playState'	-- Read the user's command or move.  						(,) playState'' `fmap` ( 							if playState' `State.PlayState.hasMorePlies` playState''@@ -1199,30 +1150,30 @@ 									quantifiedGames@(quantifiedGame : continuation {-optimal move-sequence-})	-> let 										bestTurn	= Evaluation.QuantifiedGame.getLastTurn quantifiedGame 									 in do-										elapsedTime	<- bestTurn `seq` Data.Time.measureElapsedTime startUTCTime+										stoppedWatch	<- bestTurn `seq` Property.Switchable.toggle runningWatch  										Control.Monad.when (verbosity > Data.Default.def) . System.IO.hPutStrLn System.IO.stderr . Text.ShowPrefix.showsPrefixInfo . ( 											if verbosity == maxBound 												then Property.ShowFloat.showsFloatToN nDecimalDigits ( 													Control.Monad.Reader.runReader ( 														Evaluation.Fitness.evaluateFitness Nothing game'-													) evaluationOptions	:: Attribute.WeightedMeanAndCriterionValues.WeightedMeanAndCriterionValues weightedMean criterionValue+													) evaluationOptions	:: Metric.WeightedMeanAndCriterionValues.WeightedMeanAndCriterionValues 												) . Search.Search.showsSeparator	-- Prepend the fitness of the original game prior to the result. 												else id-										 ) . Notation.MoveNotation.showsNotationFloatToNDecimals moveNotation nDecimalDigits searchResult' . showString " in " $ Data.Time.showsTimeAsSeconds nDecimalDigits elapsedTime "."+										 ) . Notation.MoveNotation.showsNotationFloatToNDecimals moveNotation nDecimalDigits searchResult' . showString " in " $ Property.ShowFloat.showsFloatToN nDecimalDigits stoppedWatch "s."  										Control.Monad.when isPostMode . putStrLn $ showsThinking searchDepth' evaluationOptions ( 											Evaluation.QuantifiedGame.getFitness $ last quantifiedGames-										 ) elapsedTime (-											Search.Search.getNPliesEvaluated searchResult'+										 ) stoppedWatch (+											Search.Search.getNPositionsEvaluated searchResult' 										 ) ( 											Text.ShowList.showsDelimitedList ( 												showChar ' ' 											) id id ( 												zipWith (-													\turn originalGame -> if either (-														const . Control.Exception.throw $ Data.Exception.mkIncompatibleData "BishBosh.UI.CECP.takeTurns:\tunexpectedly found 'NativeUIOptions'."-													) Input.CECPOptions.getDisplaySAN $ Input.UIOptions.getEitherNativeUIOrCECPOptions uiOptions+													\turn originalGame -> if const (+														Control.Exception.throw $ Data.Exception.mkIncompatibleData "BishBosh.UI.CECP.takeTurns:\tunexpectedly found 'NativeUIOptions'."+													) ||| Input.CECPOptions.getDisplaySAN $ Input.UIOptions.getEitherNativeUIOrCECPOptions uiOptions 														then ContextualNotation.StandardAlgebraic.showsTurn explicitEnpassant turn originalGame 														else Notation.MoveNotation.showsNotation moveNotation turn 												) (@@ -1235,7 +1186,7 @@  										(,) ( 											State.PlayState.updateWithAutomaticMove (-												Attribute.WeightedMeanAndCriterionValues.getCriterionValues $ Evaluation.QuantifiedGame.getWeightedMeanAndCriterionValues quantifiedGame+												Metric.WeightedMeanAndCriterionValues.getCriterionValues $ Evaluation.QuantifiedGame.getWeightedMeanAndCriterionValues quantifiedGame 											) searchState' playState' 										 ) `fmap` if ponderMode && Input.SearchOptions.getUsePondering searchOptions 											then case continuation of@@ -1258,7 +1209,7 @@ 							 ) 					 ) ( 						\(qualifiedMove, names) -> do-							elapsedTime	<- Data.Time.measureElapsedTime startUTCTime+							stoppedWatch	<- Property.Switchable.toggle runningWatch  							Data.Maybe.maybe ( 								return {-to IO-monad-} ()@@ -1268,12 +1219,14 @@  							let selectedGame	= Model.Game.applyQualifiedMove qualifiedMove game' -							Control.Monad.when (verbosity == maxBound) . System.IO.hPutStrLn System.IO.stderr . Text.ShowPrefix.showsPrefixInfo . showString "selected " . Notation.MoveNotation.showsNotation moveNotation qualifiedMove . showString " from:" . ContextualNotation.QualifiedMoveForest.showsNames maybeMaximumPGNNames names . showString "\n\tin " $ Data.Time.showsTimeAsSeconds nDecimalDigits elapsedTime "."+							Control.Monad.when (verbosity == maxBound) . System.IO.hPutStrLn System.IO.stderr . Text.ShowPrefix.showsPrefixInfo . showString "selected " . Notation.MoveNotation.showsNotation moveNotation qualifiedMove . showString " from:" . ContextualNotation.QualifiedMoveForest.showsNames maybeMaximumPGNNames names . showString "\n\tin " $ Property.ShowFloat.showsFloatToN nDecimalDigits stoppedWatch "s." -							Control.Monad.when isPostMode . putStrLn $ showsThinking searchDepth' evaluationOptions (0 :: weightedMean) elapsedTime 0 (+							Control.Monad.when isPostMode . putStrLn $ showsThinking searchDepth' evaluationOptions 0 stoppedWatch 0 ( 								Data.List.intercalate ( 									showString ".\n" $ replicate 4 ' '	-- Continuations must be preceded by at least 4 spaces.-								) $ Data.Maybe.maybe names (`take` names) maybeMaximumPGNNames+								) $ Data.Maybe.maybe names (+									(`take` names) . fromIntegral+								) maybeMaximumPGNNames 							 ) "."  							putStrLn . showString moveTag . showChar ' ' $ Notation.MoveNotation.showNotation moveNotation qualifiedMove	-- Send the move to the GUI.@@ -1306,13 +1259,13 @@ 				 ) 		 ) ( 			\gameTerminationReason -> do-				putStrLn . shows (Model.GameTerminationReason.toResult gameTerminationReason) . showString " {" $ shows gameTerminationReason "}"	-- Send the result to the GUI.+				putStrLn . shows (Rule.GameTerminationReason.toResult gameTerminationReason) . showString " {" $ shows gameTerminationReason "}"	-- Send the result to the GUI.  				let 					criterionValueStatistics	= State.PlayState.calculateCriterionValueStatistics playState'  					showsFloat :: Double -> ShowS-					showsFloat	= Numeric.showFFloat $ Just nDecimalDigits+					showsFloat	= Property.ShowFloat.showsFloatToN' nDecimalDigits  				Control.Monad.when ( 					verbosity == maxBound && not (null criterionValueStatistics)@@ -1321,7 +1274,7 @@ 				 ) criterionValueStatistics "."  				readMove positionHashQualifiedMoveTree randomGen' (-					Control.Exception.throw $ Data.Exception.mkInvalidDatum "BishBosh.UI.CECP.takeTurns.slave:\tundefined startUTCTime."+					Control.Exception.throw $ Data.Exception.mkInvalidDatum "BishBosh.UI.CECP.takeTurns.slave:\tundefined stop-watch." 				 ) playState' {-there're zero valid moves, but the user can issue commands-} >>= slave Nothing maybeMaximumPlies randomGens	-- Tail recurse.  		 ) $ Model.Game.getMaybeTerminationReason game'

@@ -29,9 +29,8 @@ 	takeTurns  ) where -import			Control.Arrow((&&&))+import			Control.Arrow((&&&), (|||)) import			Control.Monad((>=>), (<=<))-import qualified	BishBosh.Attribute.WeightedMeanAndCriterionValues		as Attribute.WeightedMeanAndCriterionValues import qualified	BishBosh.Component.Move						as Component.Move import qualified	BishBosh.Component.QualifiedMove				as Component.QualifiedMove import qualified	BishBosh.Component.Turn						as Component.Turn@@ -40,7 +39,6 @@ import qualified	BishBosh.ContextualNotation.PositionHashQualifiedMoveTree	as ContextualNotation.PositionHashQualifiedMoveTree import qualified	BishBosh.ContextualNotation.QualifiedMoveForest			as ContextualNotation.QualifiedMoveForest import qualified	BishBosh.Data.Exception						as Data.Exception-import qualified	BishBosh.Data.Time						as Data.Time import qualified	BishBosh.Evaluation.Fitness					as Evaluation.Fitness import qualified	BishBosh.Evaluation.PositionHashQuantifiedGameTree		as Evaluation.PositionHashQuantifiedGameTree import qualified	BishBosh.Evaluation.QuantifiedGame				as Evaluation.QuantifiedGame@@ -50,11 +48,13 @@ import qualified	BishBosh.Input.SearchOptions					as Input.SearchOptions import qualified	BishBosh.Input.StandardOpeningOptions				as Input.StandardOpeningOptions import qualified	BishBosh.Input.UIOptions					as Input.UIOptions+import qualified	BishBosh.Metric.WeightedMeanAndCriterionValues			as Metric.WeightedMeanAndCriterionValues import qualified	BishBosh.Model.Game						as Model.Game import qualified	BishBosh.Notation.MoveNotation					as Notation.MoveNotation import qualified	BishBosh.Property.ExtendedPositionDescription			as Property.ExtendedPositionDescription import qualified	BishBosh.Property.ForsythEdwards				as Property.ForsythEdwards import qualified	BishBosh.Property.ShowFloat					as Property.ShowFloat+import qualified	BishBosh.Property.Switchable					as Property.Switchable import qualified	BishBosh.Search.Search						as Search.Search import qualified	BishBosh.Search.SearchState					as Search.SearchState import qualified	BishBosh.State.ApplicationTerminationReason			as State.ApplicationTerminationReason@@ -65,7 +65,11 @@ import qualified	BishBosh.Text.ShowColouredPrefix				as Text.ShowColouredPrefix import qualified	BishBosh.Text.ShowList						as Text.ShowList import qualified	BishBosh.Text.ShowPrefix					as Text.ShowPrefix-import qualified	BishBosh.Types							as T+import qualified	BishBosh.Time.StopWatch						as Time.StopWatch+import qualified	BishBosh.Type.Count						as Type.Count+import qualified	BishBosh.Type.Crypto						as Type.Crypto+import qualified	BishBosh.Type.Length						as Type.Length+import qualified	BishBosh.Type.Mass						as Type.Mass import qualified	BishBosh.UI.Command						as UI.Command import qualified	BishBosh.UI.PrintObject						as UI.PrintObject import qualified	BishBosh.UI.ReportObject					as UI.ReportObject@@ -81,8 +85,6 @@ import qualified	Data.List.Extra import qualified	Data.Map import qualified	Data.Maybe-import qualified	Data.Time.Clock-import qualified	Numeric import qualified	System.IO import qualified	System.Random import qualified	ToolShed.System.Random@@ -96,15 +98,8 @@  	* Since the user can also request roll-back to an earlier game before then requesting a new move, a new game is returned rather than just the requested move. -}-readMove :: forall column criterionValue criterionWeight pieceSquareValue positionHash randomGen rankValue row weightedMean x y. (-	Control.DeepSeq.NFData					column,-#ifdef USE_PARALLEL-	Control.DeepSeq.NFData					criterionValue,-#endif-	Control.DeepSeq.NFData					criterionWeight,+readMove :: forall pieceSquareValue positionHash randomGen x y. ( 	Control.DeepSeq.NFData					pieceSquareValue,-	Control.DeepSeq.NFData					rankValue,-	Control.DeepSeq.NFData					row, 	Control.DeepSeq.NFData					x, 	Control.DeepSeq.NFData					y, 	Data.Array.IArray.Ix					x,@@ -112,48 +107,32 @@ 	Data.Array.Unboxed.IArray Data.Array.Unboxed.UArray	pieceSquareValue,	-- Requires 'FlexibleContexts'. The unboxed representation of the array-element must be defined (& therefore must be of fixed size). #endif 	Data.Bits.Bits						positionHash,-	Fractional						criterionValue, 	Fractional						pieceSquareValue,-	Fractional						rankValue,-	Fractional						weightedMean,-	Integral						column, 	Integral						x, 	Integral						y, 	Ord							positionHash, 	Read							x, 	Read							y,-	Real							criterionValue,-	Real							criterionWeight, 	Real							pieceSquareValue,-	Real							rankValue,-	Real							weightedMean,-	Show							column, 	Show							pieceSquareValue,-	Show							row, 	Show							x, 	Show							y, 	System.Random.RandomGen					randomGen  ) 	=> ContextualNotation.PositionHashQualifiedMoveTree.PositionHashQualifiedMoveTree x y positionHash 	-> randomGen-	-> Data.Time.Clock.UTCTime-	-> State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y-	-> IO (State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y)-{-# SPECIALISE readMove :: (-	Control.DeepSeq.NFData	column,-	Control.DeepSeq.NFData	row,-	Integral		column,-	Show			column,-	Show			row,-	System.Random.RandomGen	randomGen- )-	=> ContextualNotation.PositionHashQualifiedMoveTree.PositionHashQualifiedMoveTree T.X T.Y T.PositionHash+	-> Time.StopWatch.StopWatch+	-> State.PlayState.PlayState pieceSquareValue positionHash x y+	-> IO (State.PlayState.PlayState pieceSquareValue positionHash x y)+{-# SPECIALISE readMove+	:: System.Random.RandomGen randomGen+	=> ContextualNotation.PositionHashQualifiedMoveTree.PositionHashQualifiedMoveTree Type.Length.X Type.Length.Y Type.Crypto.PositionHash 	-> randomGen-	-> Data.Time.Clock.UTCTime-	-> State.PlayState.PlayState column T.CriterionValue T.CriterionWeight T.PieceSquareValue T.PositionHash T.RankValue row T.WeightedMean T.X T.Y-	-> IO (State.PlayState.PlayState column T.CriterionValue T.CriterionWeight T.PieceSquareValue T.PositionHash T.RankValue row T.WeightedMean T.X T.Y)+	-> Time.StopWatch.StopWatch+	-> State.PlayState.PlayState Type.Mass.PieceSquareValue Type.Crypto.PositionHash Type.Length.X Type.Length.Y+	-> IO (State.PlayState.PlayState Type.Mass.PieceSquareValue Type.Crypto.PositionHash Type.Length.X Type.Length.Y)  #-}-readMove positionHashQualifiedMoveTree randomGen startUTCTime playState	= let+readMove positionHashQualifiedMoveTree randomGen runningWatch playState	= let 	(game, options)			= State.PlayState.getGame &&& State.PlayState.getOptions $ playState 	(searchOptions, ioOptions)	= Input.Options.getSearchOptions &&& Input.Options.getIOOptions $ options @@ -174,7 +153,7 @@ 			Notation.MoveNotation.getOrigin moveNotation 		 ) . State.Board.getMaybePieceByCoordinates . Model.Game.getBoard -		onCommand :: UI.Command.Command x y -> IO (State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y)+		onCommand :: UI.Command.Command x y -> IO (State.PlayState.PlayState pieceSquareValue positionHash x y) 		onCommand UI.Command.Hint	= do 			Control.Monad.unless (Model.Game.isTerminated game) . Data.Maybe.maybe ( 				do@@ -244,7 +223,7 @@ 			 ) ( 				\(filePath, _) -> Control.Exception.catch ( 					do-						System.IO.withFile filePath System.IO.WriteMode (`System.IO.hPrint` (Data.Default.def :: Model.Game.Game T.X T.Y))+						System.IO.withFile filePath System.IO.WriteMode (`System.IO.hPrint` (Data.Default.def :: Model.Game.Game Type.Length.X Type.Length.Y))  						Control.Monad.when (verbosity == maxBound) . System.IO.hPutStrLn System.IO.stderr . Text.ShowColouredPrefix.showsPrefixInfo . showString "the initial game-state has been saved in " $ shows filePath "." 				) $ \e -> System.IO.hPutStrLn System.IO.stderr . Text.ShowColouredPrefix.showsPrefixError $ show (e :: Control.Exception.SomeException)@@ -252,16 +231,17 @@  			return {-to IO-monad-} $ State.PlayState.resetPositionHashQuantifiedGameTree playState 		onCommand (UI.Command.RollBack maybeNPlies)	= let-			rollBack :: Component.Move.NPlies -> IO (State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y)+			rollBack :: Type.Count.NPlies -> IO (State.PlayState.PlayState pieceSquareValue positionHash x y) 			rollBack nPlies-				| (game', _) : _ <- drop (pred nPlies) $ Model.Game.rollBack game	= do+				| (game', _) : _ <- drop (fromIntegral $ pred nPlies) $ Model.Game.rollBack game	= do 					Control.Monad.when (verbosity == maxBound) . putStrLn $ show2D game'  					return {-to IO-monad-} $ State.PlayState.reconstructPositionHashQuantifiedGameTree game' playState 				| otherwise	= onCommand UI.Command.Restart 		 in Data.Maybe.maybe ( 			let-				nPlies	= succ $ Data.Map.size searchDepthByLogicalColour	-- In fully manual play, rollback one ply, in semi-manual play rollback two plies.+				nPlies :: Type.Count.NPlies+				nPlies	= fromIntegral . succ $ Data.Map.size searchDepthByLogicalColour	-- In fully manual play, rollback one ply, in semi-manual play rollback two plies. 			in do 				Control.Monad.when (verbosity == maxBound) . System.IO.hPutStrLn System.IO.stderr . Text.ShowColouredPrefix.showsPrefixInfo . showString "rolling-back " $ shows nPlies " plies." @@ -297,7 +277,7 @@ 				do 					Control.Monad.when (verbosity == maxBound) . System.IO.hPutStrLn System.IO.stderr . Text.ShowColouredPrefix.showsPrefixInfo . showString "setting " $ shows setObject "." -					readMove positionHashQualifiedMoveTree randomGen startUTCTime playState {+					readMove positionHashQualifiedMoveTree randomGen runningWatch playState { 						State.PlayState.getOptions	= Control.DeepSeq.force $ case setObject of 							UI.SetObject.SearchDepth searchDepth	-> options { 								Input.Options.getSearchOptions	= Input.SearchOptions.setSearchDepth searchDepth $ Input.Options.getSearchOptions options@@ -319,21 +299,23 @@  				return {-to IO-monad-} playState { State.PlayState.getOptions = Input.Options.swapSearchDepth options } -		eventLoop :: IO (State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y)+		eventLoop :: IO (State.PlayState.PlayState pieceSquareValue positionHash x y) 		eventLoop	= getLine >>= \line -> case Data.List.Extra.trim line of 			"?"	-> onCommand $ UI.Command.Print UI.PrintObject.Help-			':' : s	-> either (-				\errorMessage -> do-					System.IO.hPutStrLn System.IO.stderr . Text.ShowColouredPrefix.showsPrefixError $ showString errorMessage "."--					eventLoop-			 ) (-				\(command, remainder) -> if null $ Data.List.Extra.trimStart remainder-					then onCommand command-					else do-						System.IO.hPutStrLn System.IO.stderr . showString "unexpected trailing text " $ shows remainder "."+			':' : s	-> (+				(+					\errorMessage -> do+						System.IO.hPutStrLn System.IO.stderr . Text.ShowColouredPrefix.showsPrefixError $ showString errorMessage "."  						eventLoop+				) ||| (+					\(command, remainder) -> if null $ Data.List.Extra.trimStart remainder+						then onCommand command+						else do+							System.IO.hPutStrLn System.IO.stderr . showString "unexpected trailing text " $ shows remainder "."++							eventLoop+				) 			 ) . UI.Command.readsCommand $ UI.Command.autoComplete s 			s	-> let 				corrections	= State.PlayState.suggestCorrections s playState@@ -346,7 +328,7 @@  						eventLoop	-- Recurse. 					| otherwise	-> do-						elapsedTime	<- Data.Time.measureElapsedTime startUTCTime+						stoppedWatch	<- Property.Switchable.toggle runningWatch  						let 							game'		= Model.Game.applyEitherQualifiedMove eitherQualifiedMove game@@ -357,7 +339,7 @@ 								Notation.MoveNotation.showNotation moveNotation . Data.Maybe.fromMaybe ( 									Control.Exception.throw $ Data.Exception.mkResultUndefined "BishBosh.UI.Raw.readMove.eventLoop:\tModel.Game.maybeLastTurn failed." 								) $ Model.Game.maybeLastTurn game'-							 ) . showString " was requested after " $ Data.Time.showsTimeAsSeconds nDecimalDigits elapsedTime "."+							 ) . showString " was requested after " $ Property.ShowFloat.showsFloatToN nDecimalDigits stoppedWatch "s."  							case ContextualNotation.PositionHashQualifiedMoveTree.findNextOnymousQualifiedMovesForPosition game' positionHashQualifiedMoveTree of 								[]			-> return {-to IO-monad-} ()@@ -383,21 +365,13 @@ 		Control.Monad.unless (verbosity == minBound) . putStrLn . showString "Enter either a move in " . shows moveNotation . showString "-notation, or '?' for " $ showString UI.PrintObject.helpTag ":"  		eventLoop- ) `either` (-	const . Control.Exception.throwIO $ Data.Exception.mkInvalidDatum "BishBosh.UI.Raw.readMove:\tunexpected CECP-options."+ ) ||| const (+	Control.Exception.throwIO $ Data.Exception.mkInvalidDatum "BishBosh.UI.Raw.readMove:\tunexpected CECP-options."  ) $ Input.UIOptions.getEitherNativeUIOrCECPOptions uiOptions  -- | Plays the game.-takeTurns :: forall column criterionValue criterionWeight pieceSquareValue positionHash randomGen rankValue row weightedMean x y. (-	Control.DeepSeq.NFData					column,-#ifdef USE_PARALLEL-	Control.DeepSeq.NFData					criterionValue,-#endif-	Control.DeepSeq.NFData					criterionWeight,+takeTurns :: forall pieceSquareValue positionHash randomGen x y. ( 	Control.DeepSeq.NFData					pieceSquareValue,-	Control.DeepSeq.NFData					rankValue,-	Control.DeepSeq.NFData					row,-	Control.DeepSeq.NFData					weightedMean, 	Control.DeepSeq.NFData					x, 	Control.DeepSeq.NFData					y, 	Data.Array.IArray.Ix					x,@@ -405,44 +379,28 @@ 	Data.Array.Unboxed.IArray Data.Array.Unboxed.UArray	pieceSquareValue,	-- Requires 'FlexibleContexts'. The unboxed representation of the array-element must be defined (& therefore must be of fixed size). #endif 	Data.Bits.Bits						positionHash,-	Fractional						criterionValue, 	Fractional						pieceSquareValue,-	Fractional						rankValue,-	Fractional						weightedMean,-	Integral						column, 	Integral						x, 	Integral						y, 	Ord							positionHash, 	Read							x, 	Read							y,-	Real							criterionValue,-	Real							criterionWeight, 	Real							pieceSquareValue,-	Real							rankValue,-	Real							weightedMean,-	Show							column, 	Show							pieceSquareValue,-	Show							row, 	Show							x, 	Show							y, 	System.Random.RandomGen					randomGen  ) 	=> ContextualNotation.PositionHashQualifiedMoveTree.PositionHashQualifiedMoveTree x y positionHash 	-> randomGen-	-> State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y-	-> IO (State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y)-{-# SPECIALISE takeTurns :: (-	Control.DeepSeq.NFData	column,-	Control.DeepSeq.NFData	row,-	Integral		column,-	Show			column,-	Show			row,-	System.Random.RandomGen	randomGen- )-	=> ContextualNotation.PositionHashQualifiedMoveTree.PositionHashQualifiedMoveTree T.X T.Y T.PositionHash+	-> State.PlayState.PlayState pieceSquareValue positionHash x y+	-> IO (State.PlayState.PlayState pieceSquareValue positionHash x y)+{-# SPECIALISE takeTurns+	:: System.Random.RandomGen randomGen+	=> ContextualNotation.PositionHashQualifiedMoveTree.PositionHashQualifiedMoveTree Type.Length.X Type.Length.Y Type.Crypto.PositionHash 	-> randomGen-	-> State.PlayState.PlayState column T.CriterionValue T.CriterionWeight T.PieceSquareValue T.PositionHash T.RankValue row T.WeightedMean T.X T.Y-	-> IO (State.PlayState.PlayState column T.CriterionValue T.CriterionWeight T.PieceSquareValue T.PositionHash T.RankValue row T.WeightedMean T.X T.Y)+	-> State.PlayState.PlayState Type.Mass.PieceSquareValue Type.Crypto.PositionHash Type.Length.X Type.Length.Y+	-> IO (State.PlayState.PlayState Type.Mass.PieceSquareValue Type.Crypto.PositionHash Type.Length.X Type.Length.Y)  #-} takeTurns positionHashQualifiedMoveTree randomGen playState	= let 	options	= State.PlayState.getOptions playState@@ -468,19 +426,19 @@  			slave 				:: Maybe (Concurrent.Pondering.Pondering (Component.Move.Move x y))-				-> Maybe Component.Move.NPlies+				-> Maybe Type.Count.NPlies 				-> [randomGen]-				-> State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y-				-> IO (State.PlayState.PlayState column criterionValue criterionWeight pieceSquareValue positionHash rankValue row weightedMean x y)+				-> State.PlayState.PlayState pieceSquareValue positionHash x y+				-> IO (State.PlayState.PlayState pieceSquareValue positionHash x y) 			slave maybePondering maybeMaximumPlies ~(randomGen' : randomGens) playState'	= let 				(game', searchOptions')		= State.PlayState.getGame &&& Input.Options.getSearchOptions . State.PlayState.getOptions $ playState'	-- Deconstruct. 			 in Data.Maybe.maybe ( 				do-					startUTCTime	<- Data.Time.Clock.getCurrentTime+					runningWatch	<- Property.Switchable.on  					Data.Maybe.maybe ( 						do-							playState''	<- readMove positionHashQualifiedMoveTree randomGen' startUTCTime playState'	-- Block reading a command-sequence terminating in a move from a manual player.+							playState''	<- readMove positionHashQualifiedMoveTree randomGen' runningWatch playState'	-- Block reading a command-sequence terminating in a move from a manual player.  							(,) playState'' `fmap` ( 								if playState' `State.PlayState.hasMorePlies` playState''@@ -527,7 +485,7 @@ 											bestTurn	= Evaluation.QuantifiedGame.getLastTurn quantifiedGame 											showsMove	= Notation.MoveNotation.showsNotation moveNotation bestTurn 										 in do-											elapsedTime	<- bestTurn `seq` Data.Time.measureElapsedTime startUTCTime+											stoppedWatch	<- bestTurn `seq` Property.Switchable.toggle runningWatch  											if verbosity == minBound 												then putStrLn $ showsMove ""	-- CAVEAT: potentially machine-interpreted.@@ -537,20 +495,18 @@ 															then Property.ShowFloat.showsFloatToN nDecimalDigits ( 																Control.Monad.Reader.runReader ( 																	Evaluation.Fitness.evaluateFitness Nothing game'-																) $ Input.Options.getEvaluationOptions options	:: Attribute.WeightedMeanAndCriterionValues.WeightedMeanAndCriterionValues weightedMean criterionValue+																) $ Input.Options.getEvaluationOptions options	:: Metric.WeightedMeanAndCriterionValues.WeightedMeanAndCriterionValues 															) . Search.Search.showsSeparator	-- Prepend the fitness of the original game prior to the new result. 															else id-													 ) $ (-														if verbosity > Data.Default.def-															then Notation.MoveNotation.showsNotationFloatToNDecimals moveNotation nDecimalDigits searchResult' . showString " in " . Data.Time.showsTimeAsSeconds nDecimalDigits elapsedTime-															else showsMove-													 ) "."+													 ) $ if verbosity > Data.Default.def+														then Notation.MoveNotation.showsNotationFloatToNDecimals moveNotation nDecimalDigits searchResult' . showString " in " $ Property.ShowFloat.showsFloatToN nDecimalDigits stoppedWatch "s."+														else showsMove "."  													putStrLn . show2D $ Evaluation.QuantifiedGame.getGame quantifiedGame  											(,) ( 												State.PlayState.updateWithAutomaticMove (-													Attribute.WeightedMeanAndCriterionValues.getCriterionValues $ Evaluation.QuantifiedGame.getWeightedMeanAndCriterionValues quantifiedGame+													Metric.WeightedMeanAndCriterionValues.getCriterionValues $ Evaluation.QuantifiedGame.getWeightedMeanAndCriterionValues quantifiedGame 												) searchState' playState' 											 ) `fmap` if Input.SearchOptions.getUsePondering searchOptions 												then case continuation of@@ -573,7 +529,7 @@ 								 ) 						 ) ( 							\(qualifiedMove, names) -> do-								elapsedTime	<- Data.Time.measureElapsedTime startUTCTime+								stoppedWatch	<- Property.Switchable.toggle runningWatch  								Data.Maybe.maybe ( 									return {-to IO-monad-} ()@@ -589,7 +545,7 @@ 									else do 										Control.Monad.when (verbosity > Data.Default.def) . System.IO.hPutStrLn System.IO.stderr . Text.ShowColouredPrefix.showsPrefixInfo . showString "selected " . Notation.MoveNotation.showsNotation moveNotation qualifiedMove . showString " from:" . ContextualNotation.QualifiedMoveForest.showsNames ( 											Input.IOOptions.getMaybeMaximumPGNNames ioOptions-										 ) names . showString "\n\tin " $ Data.Time.showsTimeAsSeconds nDecimalDigits elapsedTime "."+										 ) names . showString "\n\tin " $ Property.ShowFloat.showsFloatToN nDecimalDigits stoppedWatch "s."  										putStrLn $ show2D selectedGame @@ -632,7 +588,7 @@ 							criterionValueStatistics	= State.PlayState.calculateCriterionValueStatistics playState'  							showsFloat :: Double -> ShowS-							showsFloat	= Numeric.showFFloat $ Just nDecimalDigits+							showsFloat	= Property.ShowFloat.showsFloatToN' nDecimalDigits  						Control.Monad.when ( 							verbosity == maxBound && not (null criterionValueStatistics)@@ -641,7 +597,7 @@ 						 ) criterionValueStatistics "."  						readMove positionHashQualifiedMoveTree randomGen' (-							Control.Exception.throw $ Data.Exception.mkInvalidDatum "BishBosh.UI.Raw.takeTurns.slave:\tundefined startUTCTime."+							Control.Exception.throw $ Data.Exception.mkInvalidDatum "BishBosh.UI.Raw.takeTurns.slave:\tundefined stop-watch." 						 ) playState' {-there're zero valid moves, but the user can issue commands-} >>= slave Nothing maybeMaximumPlies randomGens	-- Tail recurse.  			 ) $ Model.Game.getMaybeTerminationReason game'@@ -649,7 +605,7 @@ 		Control.Monad.unless (verbosity == minBound) . putStrLn . show2D $ State.PlayState.getGame playState  		slave Nothing (Input.Options.getMaybeMaximumPlies options) (ToolShed.System.Random.randomGens randomGen) playState- ) `either` (-	const . Control.Exception.throwIO $ Data.Exception.mkInvalidDatum "BishBosh.UI.Raw.takeTurns:\tunexpected CECP-options."+ ) ||| const (+	Control.Exception.throwIO $ Data.Exception.mkInvalidDatum "BishBosh.UI.Raw.takeTurns:\tunexpected CECP-options."  ) $ Input.UIOptions.getEitherNativeUIOrCECPOptions uiOptions 

@@ -75,26 +75,41 @@ 				) . mkTypeSpecification $ Text.Case.toUpperInitial Input.Verbosity.tag 			) . showString "define the log-level; default '" $ shows (Data.Default.def :: Input.Verbosity.Verbosity) "'.", 			let+				flag	= "nDecimalDigits"+			in G.Option "d"	[flag] (+				G.ReqArg (+					Just . (,) flag . Just &&& Input.CommandLineOption.mkOptionsMutator . Data.Options.setNDecimalDigits . Input.CommandLineOption.readBoundedIntegral+				) $ mkTypeSpecification "Int"+			) . showString "define the precision with which to display floating-point numbers; default " $ shows (Data.Options.getNDecimalDigits Data.Default.def) ".",+			let 				flag	= "nGames" 			in G.Option "n"	[flag] ( 				G.ReqArg ( 					Just . (,) flag . Just &&& Input.CommandLineOption.mkOptionsMutator . Data.Options.setNGames . Input.CommandLineOption.readBoundedIntegral 				) $ mkTypeSpecification "Int"-			) "define the number of games to play.",+			) . showString "define the number of games to play; default " $ shows (Data.Options.getNGames Data.Default.def) ".", 			let 				flag	= "readTimeout" 			in G.Option "t"	[flag] ( 				G.ReqArg ( 					Just . (,) flag . Just &&& Input.CommandLineOption.mkOptionsMutator . Data.Options.setReadTimeout . Input.CommandLineOption.readBoundedIntegral-				) $ mkTypeSpecification "s"+				) $ mkTypeSpecification "Seconds" 			) . showString "define the read-timeout; default " $ shows (Data.Options.getReadTimeout Data.Default.def) " s.", 			let+				flag	= "verifyConfiguration"+			in G.Option ""	[flag] (+				G.NoArg (+					Nothing {-N/A-},+					Input.CommandLineOption.mkOptionsMutator $ Data.Options.setVerifyConfiguration True+				)+			) "verify the mutual compatibility of the two configuration-files before forwarding each to a forked instance of 'bishbosh'.",+			let 				flag	= "appendInputConfigFilePath" 			in G.Option "i"	[flag] ( 				G.ReqArg ( 					Just . (,) flag . Just &&& Input.CommandLineOption.mkOptionsMutator . Data.Options.appendInputConfigFilePath 				) $ mkTypeSpecification "File-path"-			) . showString "define the path to an XML-file, to forward to an instance of bishbosh; " $ shows Data.Options.requiredInputConfigFiles " are required, White's first, then Black's."+			) "define the path to an XML-file, to forward to a forked instance of 'bishbosh'; specify White's first, then Black's." 		 ] where 			author :: String 			author	= "Dr. Alistair Ward"@@ -119,3 +134,4 @@ 			(_, nonOptions, [])	-> Control.Exception.throwIO . Data.Exception.mkRedundantData . showString "unexpected command-line arguments; " $ shows nonOptions "." 			(_, _, errors)		-> Control.Exception.throwIO . Data.Exception.mkParseFailure $ concat errors 	 ) . G.getOpt G.RequireOrder optDescrList+

@@ -26,74 +26,91 @@  module Duel.Data.Options( -- * Types--- ** Type-synonyms-	ReadTimeout, -- ** Data-types 	Options( --		MkOptions,-		getVerbosity,+		getInputConfigFilePaths,+		getNDecimalDigits, 		getNGames, 		getReadTimeout,-		getInputConfigFilePaths+		getVerbosity,+		getVerifyConfiguration 	),--- * Constants-	requiredInputConfigFiles, -- * Functions -- ** Mutators-	setVerbosity,+	setNDecimalDigits, 	setNGames, 	setReadTimeout,+	setVerbosity,+	setVerifyConfiguration, 	appendInputConfigFilePath ) where  import qualified	Control.Exception import qualified	Data.Default-import qualified	BishBosh.Data.Exception		as Data.Exception-import qualified	BishBosh.Input.Verbosity	as Input.Verbosity-import qualified	BishBosh.Model.Game		as Model.Game+import qualified	BishBosh.Attribute.LogicalColour	as Attribute.LogicalColour+import qualified	BishBosh.Data.Exception			as Data.Exception+import qualified	BishBosh.Input.Verbosity		as Input.Verbosity+import qualified	BishBosh.Property.SelfValidating	as Property.SelfValidating+import qualified	BishBosh.Type.Count			as Type.Count import qualified	System.FilePath --- | The read-timeout in ms.-type ReadTimeout	= Int---- | Container for all comand-line options.+-- | Container for all command-line options. data Options	= MkOptions {+	getInputConfigFilePaths	:: [System.FilePath.FilePath],	-- ^ The configuration-file paths for White & Black respectively.+	getNDecimalDigits	:: Type.Count.NDecimalDigits,	-- ^ The precision with which floating-point quantities are diaplayed.+	getNGames		:: Type.Count.NGames,		-- ^ The number of successive games to play.+	getReadTimeout		:: Type.Count.NSeconds,		-- ^ The seconds to wait for a move before timing-out. CAVEAT: any positive value should account for both configuration-options (e.g. search-depth) & the machine-speed. 	getVerbosity		:: Input.Verbosity.Verbosity,	-- ^ The extent to which logging is required. CAVEAT: this isn't forwarded to the forked instances of BishBosh.-	getNGames		:: Model.Game.NGames,		-- ^ The number of successive games to play.-	getReadTimeout		:: ReadTimeout,			-- ^ The seconds to wait for a move before timing-out. CAVEAT: a positive value should account for both search-depth & the machine-speed.-	getInputConfigFilePaths	:: [System.FilePath.FilePath]+	getVerifyConfiguration	:: Bool				-- ^ Whether to check the configuration-files before forwarding them. } deriving (Eq, Show)  instance Data.Default.Default Options where 	def = MkOptions {-		getVerbosity		= Data.Default.def,+		getInputConfigFilePaths	= [],	-- CAVEAT: invalid; there must be exactly 2.+		getNDecimalDigits	= 0, 		getNGames		= 1, 		getReadTimeout		= -1,	-- N.B.: a negative value is interpreted as an indefinite period.-		getInputConfigFilePaths	= []+		getVerbosity		= Data.Default.def,+		getVerifyConfiguration	= False 	} +instance Property.SelfValidating.SelfValidating Options where+	findInvalidity	= Property.SelfValidating.findErrors [+		((/= Attribute.LogicalColour.nDistinctLogicalColours) . fromIntegral . length . getInputConfigFilePaths,	"There must be exactly one configuration file for White & one for Black.")+	 ]+ -- | Mutator.-setVerbosity :: Input.Verbosity.Verbosity -> Options -> Options-setVerbosity verbosity options	= options { getVerbosity = verbosity }+setNDecimalDigits :: Type.Count.NDecimalDigits -> Options -> Options+setNDecimalDigits nDecimalDigits options+	| nDecimalDigits < 0	= Control.Exception.throw . Data.Exception.mkOutOfBounds . showString "Duel.Data.Options:\tnDecimalDigits=" $ shows nDecimalDigits " mustn't be negative."+	| otherwise		= options { getNDecimalDigits = nDecimalDigits }  -- | Mutator.-setNGames :: Model.Game.NGames -> Options -> Options-setNGames n options-	| n <= 0	= Control.Exception.throw . Data.Exception.mkOutOfBounds . showString "Duel.Data.Options:\tnGames=" $ shows n " must exceed zero."-	| otherwise	= options { getNGames = n }+setNGames :: Type.Count.NGames -> Options -> Options+setNGames nGames options+	| nGames <= 0	= Control.Exception.throw . Data.Exception.mkOutOfBounds . showString "Duel.Data.Options:\tnGames=" $ shows nGames " must exceed zero."+	| otherwise	= options { getNGames = nGames }  -- | Mutator.-setReadTimeout :: ReadTimeout -> Options -> Options+setReadTimeout :: Type.Count.NSeconds -> Options -> Options setReadTimeout t options	= options { getReadTimeout = t } --- | The constant exact number of input config-files required.-requiredInputConfigFiles :: Int-requiredInputConfigFiles	= 2+-- | Mutator.+setVerbosity :: Input.Verbosity.Verbosity -> Options -> Options+setVerbosity verbosity options	= options { getVerbosity = verbosity }  -- | Mutator.+setVerifyConfiguration :: Bool -> Options -> Options+setVerifyConfiguration b options	= options { getVerifyConfiguration = b }++-- | Mutator. appendInputConfigFilePath :: System.FilePath.FilePath -> Options -> Options appendInputConfigFilePath s options-	| length inputConfigFilePaths == requiredInputConfigFiles	= Control.Exception.throw . Data.Exception.mkRedundantData . showString "Duel.Data.Options:\texactly " . shows requiredInputConfigFiles . showString " files are required:\t" $ shows inputConfigFilePaths "."-	| otherwise							= options { getInputConfigFilePaths = s : inputConfigFilePaths }+	| fromIntegral (+		length inputConfigFilePaths+	) == Attribute.LogicalColour.nDistinctLogicalColours	= Control.Exception.throw . Data.Exception.mkRedundantData . showString "Duel.Data.Options:\texactly " . shows Attribute.LogicalColour.nDistinctLogicalColours . showString " file-paths are required:\t" $ shows inputConfigFilePaths "."+	| otherwise						= options { getInputConfigFilePaths = s : inputConfigFilePaths } 	where 		inputConfigFilePaths	= getInputConfigFilePaths options+

@@ -61,3 +61,4 @@ 			System.IO.hGetLine handle >>= putString  			slave	-- Recurse.+

@@ -0,0 +1,95 @@+{-+	Copyright (C) 2021 Dr. Alistair Ward++	This file is part of BishBosh.++	BishBosh 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 3 of the License, or+	(at your option) any later version.++	BishBosh 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 BishBosh.  If not, see <http://www.gnu.org/licenses/>.+-}+{- |+ [@AUTHOR@]	Dr. Alistair Ward++ [@DESCRIPTION@]	Wraps "System.Process".+-}++module Duel.Process.Handles(+-- * Types+-- ** Data-types+	Handles(+--		MkHandles,+--		getStdIn,+--		getStdOut,+		getStdErr+--		getPId+	),+-- * Functions+	cleanupHandles,+	showHandles,+-- ** Accessors+	getHandlePair,+-- ** Constructor+	mkHandles+) where++import qualified	System.IO+import qualified	System.Process++-- | A container for the IO-handles & process-id of a child process.+data Handles	= MkHandles {+	getStdIn	:: System.IO.Handle,+	getStdOut	:: System.IO.Handle,+	getStdErr	:: System.IO.Handle,+	getPId		:: System.Process.ProcessHandle+}++-- | Constructor.+mkHandles :: String -> [String] -> IO Handles+mkHandles command args	= do+	(stdIn, stdOut, stdErr, pId)	<- System.Process.runInteractiveProcess command args Nothing Nothing++	sequence_ $ [+		(`System.IO.hSetBuffering` System.IO.LineBuffering),+		(`System.IO.hSetEncoding` System.IO.latin1)+	 ] <*> [stdIn, stdOut]++	return {- to IO-monad -} MkHandles {+		getStdIn	= stdIn,+		getStdOut	= stdOut,+		getStdErr	= stdErr,+		getPId		= pId+	}++-- | Accessor.+getHandlePair :: Handles -> (System.IO.Handle, System.IO.Handle)+getHandlePair MkHandles {+	getStdIn	= stdIn,+	getStdOut	= stdOut+} = (stdIn, stdOut)++-- | Show the configuration of the IO-handles.+showHandles :: Handles -> IO [String]+showHandles MkHandles {+	getStdIn	= stdIn,+	getStdOut	= stdOut,+	getStdErr	= stdErr+} = mapM System.IO.hShow [stdIn, stdOut, stdErr]++-- | Terminates the child-process & closes any IO-handles.+cleanupHandles :: Handles -> IO ()+cleanupHandles MkHandles {+	getStdIn	= stdIn,+	getStdOut	= stdOut,+	getStdErr	= stdErr,+	getPId		= pId+} = System.Process.cleanupProcess (Just stdIn, Just stdOut, Just stdErr, pId)+

@@ -21,7 +21,6 @@  [@AUTHOR@]	Dr. Alistair Ward   [@DESCRIPTION@]	Starts the two bishbosh-processes & acts as an intermediary.- -}  module Duel.Process.Intermediary (@@ -37,17 +36,30 @@ --	purge, --	startGame --	startProcess,+--	bracketProcess 	initialise ) where +import			Control.Arrow((&&&), (|||))+import			Control.Category((>>>)) import qualified	BishBosh.Attribute.LogicalColour	as Attribute.LogicalColour import qualified	BishBosh.Data.Exception			as Data.Exception import qualified	BishBosh.Input.CommandLineOption	as Input.CommandLineOption+import qualified	BishBosh.Input.IOOptions		as Input.IOOptions+import qualified	BishBosh.Input.Options			as Input.Options+import qualified	BishBosh.Input.SearchOptions		as Input.SearchOptions+import qualified	BishBosh.Input.UIOptions		as Input.UIOptions import qualified	BishBosh.Input.Verbosity		as Input.Verbosity-import qualified	BishBosh.Model.Game			as Model.Game-import qualified	BishBosh.Model.GameTerminationReason	as Model.GameTerminationReason+import qualified	BishBosh.Notation.MoveNotation		as Notation.MoveNotation import qualified	BishBosh.Property.Opposable		as Property.Opposable-import qualified	BishBosh.Types				as T+import qualified	BishBosh.Property.SelfValidating	as Property.SelfValidating+import qualified	BishBosh.Property.Switchable		as Property.Switchable+import qualified	BishBosh.Rule.GameTerminationReason	as Rule.GameTerminationReason+import qualified	BishBosh.Text.ShowList			as Text.ShowList+import qualified	BishBosh.Time.GameClock			as Time.GameClock+import qualified	BishBosh.Type.Count			as Type.Count+import qualified	BishBosh.Type.Length			as Type.Length+import qualified	BishBosh.Type.Mass			as Type.Mass import qualified	BishBosh.UI.Command			as UI.Command import qualified	Control.Exception import qualified	Control.Monad@@ -56,10 +68,11 @@ import qualified	Data.Maybe import qualified	Duel.Data.Options			as Data.Options import qualified	Duel.IO.Logger				as IO.Logger+import qualified	Duel.Process.Handles			as Process.Handles import qualified	System.Exit import qualified	System.FilePath import qualified	System.IO-import qualified	System.Process+import qualified	Text.XML.HXT.Core			as HXT  #ifdef MOVE_NOTATION #	if MOVE_NOTATION == 'I'@@ -82,7 +95,7 @@ runBishBosh 	:: Input.Verbosity.Verbosity 	-> System.FilePath.FilePath	-- ^ The path to a configuration-file.-	-> IO (System.IO.Handle, System.IO.Handle, System.IO.Handle, System.Process.ProcessHandle)+	-> IO Process.Handles.Handles runBishBosh verbosity configFilePath	= let 	command	= "bishbosh" 	args	= [@@ -95,19 +108,23 @@  in do 	Control.Monad.when (verbosity > Data.Default.def) . IO.Logger.printInfo . showString "Starting command; " $ shows (command, args) "." -	System.Process.runInteractiveProcess command args Nothing Nothing+	Process.Handles.mkHandles command args  -- | Read either a move or a game-termination reason from the specified handle. readMove 	:: Input.Verbosity.Verbosity-	-> Data.Options.ReadTimeout+	-> Type.Count.NSeconds				-- ^ Read-timout. 	-> Attribute.LogicalColour.LogicalColour	-- ^ Whose turn it is. 	-> System.IO.Handle				-- ^ Output handle from which data should be read.-	-> IO (Either Model.GameTerminationReason.GameTerminationReason (MoveNotation T.X T.Y))+	-> IO (Either Rule.GameTerminationReason.GameTerminationReason (MoveNotation Type.Length.X Type.Length.Y)) readMove verbosity readTimeout logicalColour stdOut = do-	Control.Monad.when (verbosity == maxBound) . IO.Logger.printInfo . showString "Waiting for " $ shows logicalColour "."+	Control.Monad.when (verbosity == maxBound) . IO.Logger.printInfo . showString "Waiting " . (+		if readTimeout < 0+			then showString "indefinitely"+			else showString "for up to " . shows readTimeout . showString " s"+	 ) . showString " for " $ shows logicalColour " to move." -	inputReady	<- System.IO.hWaitForInput stdOut $ 1000 * readTimeout+	inputReady	<- System.IO.hWaitForInput stdOut $ 1000 * fromIntegral readTimeout  	Control.Monad.unless inputReady . Control.Exception.throwIO . Data.Exception.mkRequestFailure . showString "Duel.Process.Intermediary.readMove:\ttimed-out after " $ shows readTimeout " s." @@ -128,45 +145,45 @@ -- | Read either a move from the first handle & write it to the second. copyMove 	:: Input.Verbosity.Verbosity-	-> Data.Options.ReadTimeout+	-> Type.Count.NSeconds				-- ^ Read-timout. 	-> Attribute.LogicalColour.LogicalColour	-- ^ Whose turn it is. 	-> System.IO.Handle				-- ^ Output handle from which move should be read. 	-> System.IO.Handle				-- ^ Input handle to which move should be forwarded.-	-> IO (Maybe Model.GameTerminationReason.GameTerminationReason)+	-> IO (Maybe Rule.GameTerminationReason.GameTerminationReason) copyMove verbosity readTimeout logicalColour stdOut stdIn = do-	readMove verbosity readTimeout logicalColour stdOut >>= (-		return {-to IO-monad-} . Just-	 ) `either` (+	readMove verbosity readTimeout logicalColour stdOut >>= return {-to IO-monad-} . Just ||| ( 		\move	-> do 			System.IO.hPrint stdIn move  			return {-to IO-monad-} Nothing 	 ) --- | Contains stdin & stdout handles respectively.+-- | Contains /stdin/ & /stdout/ handles respectively. type IOHandles	= (System.IO.Handle, System.IO.Handle)  -- | Shuttle moves between the two child processes until the game terminates. play-	:: Input.Verbosity.Verbosity-	-> Data.Options.ReadTimeout+	:: Property.Switchable.Switchable gameClock+	=> Input.Verbosity.Verbosity+	-> Type.Count.NSeconds	-- ^ Read-timout. 	-> IOHandles 	-> IOHandles-	-> IO Model.GameTerminationReason.GameTerminationReason+	-> gameClock+	-> IO (Rule.GameTerminationReason.GameTerminationReason, gameClock) play verbosity readTimeout	= slave maxBound	where-	slave logicalColour producer@(_, stdOut) consumer@(stdIn', stdOut')	= copyMove verbosity readTimeout logicalColour stdOut stdIn' >>= Data.Maybe.maybe (+	slave logicalColour producer@(_, stdOut) consumer@(stdIn', stdOut') gameClock	= copyMove verbosity readTimeout logicalColour stdOut stdIn' >>= Data.Maybe.maybe ( 		do 			Control.Monad.when (verbosity == maxBound) $ IO.Logger.printInfo "Swapping player-roles." -			slave (Property.Opposable.getOpposite logicalColour) consumer producer	-- Recurse.+			Property.Switchable.toggle gameClock >>= slave (Property.Opposable.getOpposite logicalColour) consumer producer	-- Recurse. 	 ) ( 		\gameTerminationReason -> do 			readMove verbosity readTimeout logicalColour stdOut' >>= ( 				\gameTerminationReason' -> do 					Control.Monad.unless (gameTerminationReason == gameTerminationReason') . Control.Exception.throwIO . Data.Exception.mkIncompatibleData . showString "Duel.Process.Intermediary.play:\tsecond game terminated for a different reason; " $ shows gameTerminationReason' "." -					return {-to IO-monad-} gameTerminationReason-			 ) `either` (+					return {-to IO-monad-} (gameTerminationReason, gameClock)+			 ) ||| ( 				\move	-> Control.Exception.throwIO . Data.Exception.mkParseFailure . showString "Duel.Process.Intermediary.play:\tread from " . shows (Property.Opposable.getOpposite logicalColour) . showString ", unexpected move='" $ shows move "'." 			 ) 	 )@@ -181,33 +198,42 @@ {- | 	* Accumulates the frequency of each game-termination reason -	* N.B.: the recorded result is merely a string, though it could be read into a 'BishBosh.Model.GameTerminationReason'.+	* N.B.: the recorded result is merely a string, though it could be read into a 'BishBosh.Rule.GameTerminationReason'. -}-type GameTerminationReasonsMap	= Data.Map.Strict.Map Model.GameTerminationReason.GameTerminationReason Int+type GameTerminationReasonsMap	= Data.Map.Strict.Map Rule.GameTerminationReason.GameTerminationReason Type.Count.NGames  {- |-	* Start two independently configured (though of matching move-notation) instances of 'bishbosh'.+	* Constructs a game-clock. +	* Starts two independently configured (though of matching move-notation) concurrent instances of 'bishbosh'.+ 	* One instance automates White & one automates Black.  	* Shuttle moves between the instances. -	* Plays repeatedly & accumulating the final results of each game.+	* Plays repeatedly, measuring both the total time taken by each side & accumulating the final results of each game.++	* Prints the total time taken by either side, & returns the accumulated results of each game. -} startGame 	:: Input.Verbosity.Verbosity-	-> Data.Options.ReadTimeout-	-> IOHandles	-- ^ White's handles.-	-> IOHandles	-- ^ Black's handles.+	-> Type.Count.NDecimalDigits+	-> Type.Count.NSeconds	-- ^ Read-timeout.+	-> IOHandles		-- ^ White's handles.+	-> IOHandles		-- ^ Black's handles. 	-> GameTerminationReasonsMap-	-> Model.Game.NGames+	-> Type.Count.NGames 	-> IO GameTerminationReasonsMap-startGame verbosity readTimeout producer consumer	= slave where-	slave gameTerminationReasonsMap 0	= return {-to IO-monad-} gameTerminationReasonsMap-	slave gameTerminationReasonsMap nGames	= do+startGame verbosity nDecimalDigits readTimeout producer consumer gameTerminationReasonsMap nGames	= Property.Switchable.on >>= slave gameTerminationReasonsMap nGames where+	slave :: GameTerminationReasonsMap -> Type.Count.NGames -> Time.GameClock.GameClock -> IO GameTerminationReasonsMap+	slave gameTerminationReasonsMap' 0 gameClock	= do+		Time.GameClock.showsElapsedTimes nDecimalDigits gameClock >>= IO.Logger.printInfo . showString "Elapsed time" . Text.ShowList.showsAssociation . ($ ".")++		return {-to IO-monad-} gameTerminationReasonsMap'+	slave gameTerminationReasonsMap' nGames' gameClock	= do 		Control.Monad.when (verbosity == maxBound) $ IO.Logger.printInfo "Starting game." -		gameTerminationReason	<- play verbosity readTimeout producer consumer+		(gameTerminationReason, gameClock')	<- play verbosity readTimeout producer consumer gameClock  		sequence_ $ [ 			\(_, stdOut) -> do@@ -221,58 +247,91 @@ 		 ] <*> [consumer, producer]  		slave (-			Data.Map.Strict.insertWith (const succ) gameTerminationReason 1 gameTerminationReasonsMap-		 ) $ pred nGames -- Recurse.+			Data.Map.Strict.insertWith (const succ) gameTerminationReason 1 gameTerminationReasonsMap'+		 ) (+			pred nGames' -- Recurse.+		 ) gameClock' --- | Start 'bishbosh', print any errors, unbuffer its I/O, & return the process-handles.+-- | Start 'bishbosh', print any errors, & return the process-handles. startProcess 	:: Input.Verbosity.Verbosity 	-> System.FilePath.FilePath	-- ^ The path to a configuration-file.-	-> IO (System.IO.Handle, System.IO.Handle, System.IO.Handle, System.Process.ProcessHandle)+	-> IO Process.Handles.Handles startProcess verbosity configFilePath	= do-	handles@(stdIn, stdOut, stdErr, _)	<- runBishBosh verbosity configFilePath--	IO.Logger.dump stdErr+	handles	<- runBishBosh verbosity configFilePath -	sequence_ $ [-		(`System.IO.hSetBuffering` System.IO.LineBuffering),-		(`System.IO.hSetEncoding` System.IO.latin1)-	 ] <*> [stdIn, stdOut]+	IO.Logger.dump $ Process.Handles.getStdErr handles -	Control.Monad.when (verbosity == maxBound) $ mapM System.IO.hShow [stdIn, stdOut, stdErr] >>= IO.Logger.printInfo . show+	Control.Monad.when (verbosity == maxBound) $ Process.Handles.showHandles handles >>= mapM_ IO.Logger.printInfo  	return {-to IO-monad-} handles --- | Play the requested number of games & display the accumulated results.+-- | Starts the process, performs the requested action, then clean-up.+bracketProcess+	:: Input.Verbosity.Verbosity+	-> [System.FilePath.FilePath]		-- ^ The configuration-file paths for White & Black respectively.+	-> ([Process.Handles.Handles] -> IO ())	-- ^ Run the game.+	-> IO ()+bracketProcess verbosity inputConfigFilePaths	= Control.Exception.bracket (+	startProcess verbosity `mapM` inputConfigFilePaths+ ) (+	sequence . (+		[+			IO.Logger.dump . Process.Handles.getStdErr,+			Process.Handles.cleanupHandles+		] <*>+	)+ )++{- |+	* Unpacks the configuration-options.++	* Optionally verifies the compatibility of the two configuration-files.++	* Plays the requested number of games.++	* Prints the results.+-} initialise :: Data.Options.Options -> IO ()-initialise options	= let-	verbosity	= Data.Options.getVerbosity options- in Control.Exception.catch (-	Control.Exception.bracket (-		startProcess verbosity `mapM` Data.Options.getInputConfigFilePaths options-	) (-		\processes@[(_, _, stdErr, _), (_, _, stdErr', _)] -> do-			mapM_ IO.Logger.dump [stdErr, stdErr']+initialise options+	| errorMessages@(_ : _)	<- Property.SelfValidating.findInvalidity options	= Control.Exception.throwIO . Data.Exception.mkInsufficientData . showString "Duel.Process.Intermediary.initialise:\tinvalid options; " $ show errorMessages+	| otherwise									= let+		(verbosity, inputConfigFilePaths)	= Data.Options.getVerbosity &&& Data.Options.getInputConfigFilePaths $ options+		hxtTraceLevel				= fromEnum verbosity `min` 2 {-CAVEAT: HXT trace-levels 3 & 4 are too verbose-}+	in Control.Exception.catch (+		do+			Control.Monad.when (Data.Options.getVerifyConfiguration options) $ do+				[(logicalColoursFirst, moveNotationFirst), (logicalColoursSecond, moveNotationSecond)]	<- mapM (+					\configFilePath -> do+						[pair]	<- HXT.runX $ HXT.setTraceLevel hxtTraceLevel+							>>> HXT.xunpickleDocument HXT.xpickle [+								HXT.withRemoveWS HXT.yes,+								HXT.withStrictInput HXT.no	-- Only a fraction of the document is required.+							] configFilePath+							>>> HXT.arr (+								 \inputOptions -> Input.SearchOptions.identifyAutomatedPlayers . Input.Options.getSearchOptions &&& Input.UIOptions.getMoveNotation . Input.IOOptions.getUIOptions . Input.Options.getIOOptions $ (+									inputOptions	:: Input.Options.Options Type.Mass.PieceSquareValue Type.Length.X Type.Length.Y	-- Arbitrary concrete type.+								 )+							) -- Lift function into an arrow. -			Control.Monad.when (verbosity == maxBound) $ IO.Logger.printInfo "Cleaning-up child processes."+						return {-to IO-monad-} pair+				 ) inputConfigFilePaths -			mapM_ (-				\(hIn, hOut, hErr, pId) -> System.Process.cleanupProcess (Just hIn, Just hOut, Just hErr, pId)-			 ) processes-	) (-		\[(stdIn, stdOut, _, _), (stdIn', stdOut', _, _)] -> startGame verbosity (-			Data.Options.getReadTimeout options-		) (-			stdIn, stdOut-		) (-			stdIn', stdOut'-		) Data.Map.Strict.empty (-			Data.Options.getNGames options-		) >>= IO.Logger.printInfo . show . Data.Map.Strict.toList-	)- ) $ \e -> do-	IO.Logger.printError . showString "caught " $ show (e :: Control.Exception.SomeException)+				Control.Monad.unless (logicalColoursFirst == [maxBound] && logicalColoursSecond == [minBound]) . Control.Exception.throwIO . Data.Exception.mkIncompatibleData . showString "Duel.Process.Intermediary.initialise:\tconfiguration-files must automate White & Black respectively; " $ shows (logicalColoursFirst ++ logicalColoursSecond) "." -	Control.Monad.when (verbosity == maxBound) $ IO.Logger.printInfo "Exiting."+				Control.Monad.unless (moveNotationFirst == moveNotationSecond) . Control.Exception.throwIO . Data.Exception.mkIncompatibleData . showString "Duel.Process.Intermediary.initialise:\tconfiguration-files must define the same " . showString Notation.MoveNotation.tag . Text.ShowList.showsAssociation $ shows (moveNotationFirst, moveNotationSecond) "." -	System.Exit.exitFailure+			bracketProcess verbosity inputConfigFilePaths $ \[handles, handles'] -> uncurry (+				uncurry (startGame verbosity) $ (Data.Options.getNDecimalDigits &&& Data.Options.getReadTimeout) options+			 ) (+				($ handles) &&& ($ handles') $ Process.Handles.getHandlePair+			 ) Data.Map.Strict.empty (+				Data.Options.getNGames options+			 ) >>= IO.Logger.printInfo . show . Data.Map.Strict.toList+	) $ \e -> do+		IO.Logger.printError . showString "caught " $ show (e :: Control.Exception.SomeException)++		Control.Monad.when (verbosity == maxBound) $ IO.Logger.printInfo "Exiting."++		System.Exit.exitFailure+

@@ -29,9 +29,8 @@  module Main(main) where -import			BishBosh.Data.Float()--- import		BishBosh.Data.Ratio()	-- Required if either criterionWeight or criterionValue is Rational.-import			Control.Arrow((&&&), (***))+--import		BishBosh.Data.Ratio()	-- Required if either Type.Mass.CriterionWeight or Type.Mass.CriterionValue is Rational.+import			Control.Arrow((&&&), (***), (|||)) import			Control.Category((>>>)) import			Data.Array.IArray((!)) import qualified	BishBosh.Component.PieceSquareByCoordinatesByRank	as Component.PieceSquareByCoordinatesByRank@@ -58,14 +57,16 @@ import qualified	BishBosh.Text.ShowColouredPrefix			as Text.ShowColouredPrefix import qualified	BishBosh.Text.ShowList					as Text.ShowList import qualified	BishBosh.Text.ShowPrefix				as Text.ShowPrefix-import qualified	BishBosh.Types						as T+import qualified	BishBosh.Type.Count					as Type.Count+import qualified	BishBosh.Type.Crypto					as Type.Crypto+import qualified	BishBosh.Type.Length					as Type.Length+import qualified	BishBosh.Type.Mass					as Type.Mass import qualified	Control.Exception import qualified	Control.Monad import qualified	Data.Default import qualified	Data.List import qualified	Data.Maybe import qualified	Data.Version-import qualified	Numeric import qualified	Paths_bishbosh						as Paths	-- Either local stub, or package-instance auto-generated by 'Setup build'. import qualified	System.Console.GetOpt					as G import qualified	System.Directory@@ -81,10 +82,6 @@ import qualified	ToolShed.System.File import			System.FilePath((</>), (<.>)) -#ifdef USE_NARROW_NUMBERS-import			BishBosh.Data.Integral()	-- HXT.XmlPickler.-#endif- #ifdef USE_HXTRELAXNG import qualified	Text.XML.HXT.RelaxNG #endif@@ -98,9 +95,7 @@ #endif  -- Define concrete types to resolve the underlying polymorphic functions.-type Row	= T.Y-type Column	= T.X		-- N.B. there's no requirement to be the same type as Row.-type Options	= Input.Options.Options Column T.CriterionWeight T.PieceSquareValue T.RankValue Row T.X T.Y+type Options	= Input.Options.Options Type.Mass.PieceSquareValue Type.Length.X Type.Length.Y  writeXMLToFile 	:: HXT.XmlPickler pickleable@@ -232,9 +227,9 @@ 			mkTypeSpecification s	= showChar '<' $ showString s ">"  			intTypeSpecification, filePathTypeSpecification :: String-			(intTypeSpecification, filePathTypeSpecification)		= ($ intString) &&& ($ filePathString) $ mkTypeSpecification+			(intTypeSpecification, filePathTypeSpecification)	= ($ intString) &&& ($ filePathString) $ mkTypeSpecification -			defaultUIOptions :: Input.UIOptions.UIOptions Row Column+			defaultUIOptions :: Input.UIOptions.UIOptions 			defaultUIOptions	= Data.Default.def  			defaultRandomSeed :: Input.Options.RandomSeed@@ -282,7 +277,7 @@ 					) ["Opening", "End"] 				) $ map ( 					\selector	-> Component.PieceSquareByCoordinatesByRank.formatForGNUPlot (-						Numeric.showFFloat . Just . Input.UIOptions.getNDecimalDigits . Input.IOOptions.getUIOptions $ Input.Options.getIOOptions options	-- PieceSquareValue formatter.+						Property.ShowFloat.showsFloatToN' . Input.UIOptions.getNDecimalDigits . Input.IOOptions.getUIOptions $ Input.Options.getIOOptions options	-- PieceSquareValue formatter. 					) ( 						showChar '\t'	-- Column-delimiter. 					) (@@ -331,17 +326,6 @@ 							configDir :: System.FilePath.FilePath 							configDir	= dataDir </> "config" -							inputSysConfigList :: HXT.SysConfigList-							inputSysConfigList	= [-								HXT.withRemoveWS HXT.yes,						-- Remove white-space, e.g. any indentation which might have been introduced by 'HXT.withIndent'.-								HXT.withStrictInput HXT.yes,						-- Read the input file strictly (cf. lazily), this ensures file-closure even if not completely read.-#ifdef USE_HXTRELAXNG-								Text.XML.HXT.RelaxNG.withRelaxNG $ configDir </> progName <.> "rng"	-- Validate against the referenced RelaxNG schema.-#else-								HXT.withValidate HXT.yes						-- Validate against any DTD referenced from the specified XML-file.-#endif-							 ]- 							hxtTraceLevel :: Int 							hxtTraceLevel	= fromEnum preVerbosity `min` 2	{-CAVEAT: HXT trace-levels 3 & 4 are too verbose-} @@ -365,7 +349,7 @@ 								(showsInfoPrefix, showsWarningPrefix)	= const ( 									Text.ShowColouredPrefix.showsPrefixInfo, 									Text.ShowColouredPrefix.showsPrefixWarning-								 ) `either` const (+								 ) ||| const ( 									Text.ShowPrefix.showsPrefixInfo, 									Text.ShowPrefix.showsPrefixWarning 								 ) $ Input.UIOptions.getEitherNativeUIOrCECPOptions uiOptions@@ -423,14 +407,16 @@ 										 ) executablePath 									in ( 										\pgnDatabase -> do-											Control.Monad.when (verbosity == maxBound) . System.IO.hPutStrLn System.IO.stderr . showsInfoPrefix . showString "read PGN-database" . Text.ShowList.showsAssociation . shows pgnDatabaseFilePath . showString " containing (nGames, nMoves)" . Text.ShowList.showsAssociation $ shows (+											Control.Monad.when (verbosity == maxBound) . System.IO.hPutStrLn System.IO.stderr . showsInfoPrefix . showString "read PGN-database" . Text.ShowList.showsAssociation . shows pgnDatabaseFilePath . showString " containing (nGames, nPositions)" . Text.ShowList.showsAssociation $ shows ( 												Data.List.foldl' ( 													\acc pgn -> let-														acc'@(nGames, nPlies)	= succ *** (-															+ State.TurnsByLogicalColour.getNPlies (Model.Game.getTurnsByLogicalColour $ ContextualNotation.PGN.getGame pgn)+														acc'@(nGames, nPositions)	= succ *** (+															+ State.TurnsByLogicalColour.getNPlies (+																Model.Game.getTurnsByLogicalColour $ ContextualNotation.PGN.getGame pgn+															) 														 ) $ acc-													in nGames `seq` nPlies `seq` acc'-												) (0 :: Model.Game.NGames, 0) pgnDatabase+													in nGames `seq` nPositions `seq` acc'+												) (0 :: Type.Count.NGames, 0) pgnDatabase 											 ) "."	-- CAVEAT: this stalls rendering of the native UI.  											return {-to IO-monad-} $ ContextualNotation.QualifiedMoveForest.mergePGNDatabase pgnDatabase qualifiedMoveForest@@ -460,16 +446,24 @@ 								 ) Property.Empty.empty {-QualifiedMoveForest-} (Input.IOOptions.getPGNOptionsList ioOptions)  								let-									maybeApplicationTerminationReason	= State.PlayState.getMaybeApplicationTerminationReason (playState :: State.PlayState.PlayState Column T.CriterionValue T.CriterionWeight T.PieceSquareValue T.PositionHash T.RankValue Row T.WeightedMean T.X T.Y)+									maybeApplicationTerminationReason	= State.PlayState.getMaybeApplicationTerminationReason (playState :: State.PlayState.PlayState Type.Mass.PieceSquareValue Type.Crypto.PositionHash Type.Length.X Type.Length.Y) 								 in Control.Monad.when ( 									verbosity /= minBound && Data.Maybe.isJust maybeApplicationTerminationReason 								 ) . System.IO.hPutStrLn System.IO.stderr . showsInfoPrefix . showString "application terminated " $ shows (Data.Maybe.fromJust maybeApplicationTerminationReason) "."  								return {-to IO-monad-} options' 						in Control.Monad.void {-discard the state returned by processInputOptions-} . HXT.runX $ HXT.setTraceLevel hxtTraceLevel-							>>> HXT.xunpickleDocument HXT.xpickle inputSysConfigList configFilePath+							>>> HXT.xunpickleDocument HXT.xpickle [+								HXT.withRemoveWS HXT.yes,						-- Remove white-space, e.g. any indentation which might have been introduced by 'HXT.withIndent'.+								HXT.withStrictInput HXT.yes,						-- Read the input file strictly (cf. lazily), this ensures file-closure even if not completely read.+#ifdef USE_HXTRELAXNG+								Text.XML.HXT.RelaxNG.withRelaxNG $ configDir </> progName <.> "rng"	-- Validate against the referenced RelaxNG schema.+#else+								HXT.withValidate HXT.yes						-- Validate against any DTD referenced from the specified XML-file.+#endif+							] configFilePath 							>>> HXT.traceMsg hxtTraceLevel (showString Input.Options.tag " parsed")-							>>> HXT.arrIO processInputOptions+							>>> HXT.arrIO processInputOptions	-- Lift an IO-function into an arrow. 			| otherwise	-> Control.Exception.throwIO . Data.Exception.mkInsufficientData $ shows (Input.CommandLineOption.longFlagPrefix ++ inputConfigFilePathFlag) " must be specified." 			where 				categorisedCommandLineOptions		= Input.CommandLineOption.categorise $ map snd commandLineOptions

@@ -1,109 +0,0 @@-{-# LANGUAGE CPP #-}-{--	Copyright (C) 2018 Dr. Alistair Ward--	This file is part of BishBosh.--	BishBosh 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 3 of the License, or-	(at your option) any later version.--	BishBosh 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 BishBosh.  If not, see <http://www.gnu.org/licenses/>.--}-{- |- [@AUTHOR@]	Dr. Alistair Ward-- [@DESCRIPTION@]--	* Defines the value of a single /criterion/, which quantifies the significance of some concept;-	many such criteria may exist, & their weighted-mean drives automated selection of /move/s.--	* Each /criterion-value/ is normalised into the /signed closed unit-interval/.-- [@CAVEAT@]--	* While this data-type could implement the classes 'Num', 'Fractional' & 'Real', these interfaces would allow one to construct invalid instances.--}--module BishBosh.Attribute.CriterionValue(--- * Types--- ** Data-types-	CriterionValue(),--- * Constants-	zero,--- * Functions-	calculateWeightedMean,--- ** Constructor-	mkCriterionValue-) where--import			Control.Arrow((&&&))-import qualified	BishBosh.Attribute.CriterionWeight			as Attribute.CriterionWeight-import qualified	BishBosh.Attribute.WeightedMeanAndCriterionValues	as Attribute.WeightedMeanAndCriterionValues-import qualified	BishBosh.Types						as T-import qualified	Control.Exception-import qualified	Factory.Math.Statistics--#ifdef USE_PARALLEL-import qualified	Control.DeepSeq-import qualified	Control.Parallel.Strategies-#endif---- | Quantifies some criterion; the larger the signed value, the better.-newtype CriterionValue criterionValue	= MkCriterionValue criterionValue deriving (Eq, Show)--instance Num criterionValue => Bounded (CriterionValue criterionValue) where-	minBound	= MkCriterionValue $ negate 1-	maxBound	= MkCriterionValue 1---- | Smart constructor.-mkCriterionValue :: (-	Num	criterionValue,-	Ord	criterionValue- ) => criterionValue -> CriterionValue criterionValue-mkCriterionValue criterionValue	= Control.Exception.assert (abs criterionValue <= 1) $ MkCriterionValue criterionValue---- | Constant.-zero :: Num criterionValue => CriterionValue criterionValue-zero	= MkCriterionValue 0--{- |-	* Calculates the /weighted mean/ of the specified 'CriterionValue's using the corresponding /criterion-weight/s.--	* Also writes individual unweighted 'CriterionValue's, to facilitate post-analysis;-	if the corresponding weight is @0@, evaluation of the criterion is, for efficiency, avoided.--	* CAVEAT: if all weights are @0@, then the result is indeterminate.--}-calculateWeightedMean :: (-#ifdef USE_PARALLEL-	Control.DeepSeq.NFData	criterionValue,-#endif-	Fractional		weightedMean,-	Real			criterionValue,-	Real			criterionWeight- ) => [(CriterionValue criterionValue, Attribute.CriterionWeight.CriterionWeight criterionWeight)] -> Attribute.WeightedMeanAndCriterionValues.WeightedMeanAndCriterionValues weightedMean criterionValue-{-# INLINABLE calculateWeightedMean #-}-{-# SPECIALISE calculateWeightedMean :: [(CriterionValue T.CriterionValue, Attribute.CriterionWeight.CriterionWeight T.CriterionWeight)] -> Attribute.WeightedMeanAndCriterionValues.WeightedMeanAndCriterionValues T.WeightedMean T.CriterionValue #-}-calculateWeightedMean assocs	= uncurry Attribute.WeightedMeanAndCriterionValues.mkWeightedMeanAndCriterionValues $ (-	Factory.Math.Statistics.getWeightedMean &&& map fst- )-#ifdef USE_PARALLEL-	$ Control.Parallel.Strategies.withStrategy (-		Control.Parallel.Strategies.parList $ Control.Parallel.Strategies.evalTuple2 Control.Parallel.Strategies.rdeepseq Control.Parallel.Strategies.r0-	)-#endif-	[-		(bareCriterionValue, bareCriterionWeight) |-			(MkCriterionValue bareCriterionValue, criterionWeight)	<- assocs,-			let bareCriterionWeight	= Attribute.CriterionWeight.deconstruct criterionWeight,-			bareCriterionWeight /= 0-	] -- List-comprehension.-

@@ -1,90 +0,0 @@-{--	Copyright (C) 2018 Dr. Alistair Ward--	This file is part of BishBosh.--	BishBosh 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 3 of the License, or-	(at your option) any later version.--	BishBosh 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 BishBosh.  If not, see <http://www.gnu.org/licenses/>.--}-{- |- [@AUTHOR@]	Dr. Alistair Ward-- [@DESCRIPTION@]--	* Defines the weight associated with some 'Attribute.CriterionValue.CriterionValue'.--	* Each weighting is constrained to the unsigned /closed unit-interval/; negative values aren't permitted.--	* If the /criterion-value/ is considered unimportant, then its weight can be set to @0@, whilst concepts of great significance can be set to @1@.-- [@CAVEAT@]--	* While this data-type could implement the classes 'Functor', 'Num', 'Fractional' & 'Real', these interfaces allow one to construct invalid instances.--}--module BishBosh.Attribute.CriterionWeight(--- * Types--- ** Data-types-	CriterionWeight(---		MkCriterionWeight,-		deconstruct-	),--- * Functions--- ** Constructor-	mkCriterionWeight-) where--import qualified	BishBosh.Data.Exception		as Data.Exception-import qualified	BishBosh.Data.Num		as Data.Num-import qualified	BishBosh.Text.ShowList		as Text.ShowList-import qualified	Control.DeepSeq-import qualified	Control.Exception-import qualified	Data.Default-import qualified	Text.XML.HXT.Arrow.Pickle	as HXT---- | Quantifies the relative significance, of a criterion-value; the larger the weight, the more significant the criterion is relative to other criteria.-newtype CriterionWeight criterionWeight	= MkCriterionWeight {-	deconstruct	:: criterionWeight-} deriving (Eq, Ord)--instance Show criterionWeight => Show (CriterionWeight criterionWeight) where-	showsPrec _ (MkCriterionWeight criterionWeight)	= shows criterionWeight--instance Num criterionWeight => Bounded (CriterionWeight criterionWeight) where-	minBound	= MkCriterionWeight 0-	maxBound	= MkCriterionWeight 1--instance Num criterionWeight => Data.Default.Default (CriterionWeight criterionWeight) where-	def	= minBound--instance Control.DeepSeq.NFData criterionWeight => Control.DeepSeq.NFData (CriterionWeight criterionWeight) where-	rnf (MkCriterionWeight criterionWeight)	= Control.DeepSeq.rnf criterionWeight--instance (-	HXT.XmlPickler	criterionWeight,-	Num		criterionWeight,-	Ord		criterionWeight,-	Show		criterionWeight- ) => HXT.XmlPickler (CriterionWeight criterionWeight) where-	xpickle	= HXT.xpWrap (mkCriterionWeight, deconstruct) HXT.xpickle---- | Smart constructor.-mkCriterionWeight :: (-	Num	criterionWeight,-	Ord	criterionWeight,-	Show	criterionWeight- ) => criterionWeight -> CriterionWeight criterionWeight-mkCriterionWeight criterionWeight-	| Data.Num.inClosedUnitInterval criterionWeight	= MkCriterionWeight criterionWeight-	| otherwise					= Control.Exception.throw . Data.Exception.mkOutOfBounds . showString "BishBosh.Attribute.CriterionWeight.mkCriterionWeight:\tweight" . Text.ShowList.showsAssociation $ shows criterionWeight " must be within the closed unit-interval, '[0,1]'."-

@@ -32,7 +32,6 @@ module BishBosh.Attribute.Direction( -- * Types -- ** Type-synonyms-	NDirections, 	ArrayByDirection, -- ** Data-types 	Direction(@@ -73,6 +72,7 @@ import qualified	BishBosh.Property.Opposable		as Property.Opposable import qualified	BishBosh.Property.Orientated		as Property.Orientated import qualified	BishBosh.Property.Reflectable		as Property.Reflectable+import qualified	BishBosh.Type.Count			as Type.Count import qualified	Control.DeepSeq import qualified	Control.Exception import qualified	Data.Array.IArray@@ -116,9 +116,6 @@ se :: Direction se	= MkDirection GT LT --- | A number of /direction/s.-type NDirections	= Int	-- N.B.: 'Data.Int.Int8' saves neither time nor space.- -- | Define a /direction/ by the sense of change to /x/ & /y/ coordinates. data Direction	= MkDirection { 	getXDirection	:: Ordering,	-- ^ The sense of the change in the /x/-coordinate.@@ -224,7 +221,7 @@ instance Property.FixedMembership.FixedMembership Direction where 	members	= range --- | Smart-constructor.+-- | Smart constructor. mkDirection 	:: Ordering	-- ^ The sense of the change in the /x/-coordinate. 	-> Ordering	-- ^ The sense of the change in the /y/-coordinate.@@ -241,8 +238,8 @@ diagonals	= [sw, nw, se, ne]  -- | The constant number of distinct /direction/s.-nDistinctDirections :: NDirections-nDistinctDirections	= length range+nDistinctDirections :: Type.Count.NDirections+nDistinctDirections	= fromIntegral $ length range  {- | 	* Returns a list of /direction/s, each paired with its anti-parallel.

@@ -51,6 +51,7 @@ import qualified	BishBosh.Property.FixedMembership		as Property.FixedMembership import qualified	BishBosh.Property.ForsythEdwards		as Property.ForsythEdwards import qualified	BishBosh.Property.Opposable			as Property.Opposable+import qualified	BishBosh.Type.Count				as Type.Count import qualified	Control.DeepSeq import qualified	Control.Exception import qualified	Data.Array.IArray@@ -92,8 +93,8 @@ 	members	= range  -- | The constant number of distinct /logical colour/s.-nDistinctLogicalColours :: Int-nDistinctLogicalColours	= length range+nDistinctLogicalColours :: Type.Count.NLogicalColours+nDistinctLogicalColours	= fromIntegral $ length range  instance HXT.XmlPickler LogicalColour where 	xpickle	= HXT.xpAttr tag . HXT.xpWrap (read, show) . HXT.xpTextDT . Text.XML.HXT.Arrow.Pickle.Schema.scEnum $ map show range

@@ -56,3 +56,4 @@ -- | Whether the specified /logical colour/ is @Black@. isBlack :: LogicalColourOfSquare -> Bool isBlack MkLogicalColourOfSquare { deconstruct = logicalColour }	= Attribute.LogicalColour.isBlack logicalColour+

@@ -170,7 +170,7 @@ 			maybePromotionRank	<- Nothing : map Just Attribute.Rank.promotionProspects 	 ] -- List-comprehension. --- | Smart-constructor for normal move-types.+-- | Smart constructor for normal move-types. mkMaybeNormalMoveType 	:: Maybe Attribute.Rank.Rank	-- ^ The /rank/ of any opposing /piece/ which was just taken. 	-> Maybe Attribute.Rank.Rank	-- ^ The /rank/ to which a @Pawn@ was just promoted.

@@ -1,4 +1,3 @@-{-# LANGUAGE LambdaCase #-} {- 	Copyright (C) 2018 Dr. Alistair Ward @@ -31,7 +30,6 @@ -- * Types -- ** Type-synonyms 	EvaluateRank,---	NRanks, 	ArrayByRank, 	UArrayByRank, -- ** Data-types@@ -51,6 +49,7 @@ 	earthBound, 	expendable, 	nDistinctRanks,+--	allocationPerSide, -- * Functions 	compareByLVA, 	findUndefinedRanks,@@ -59,7 +58,9 @@ 	arrayByRank ) where +import qualified	BishBosh.Metric.RankValue		as Metric.RankValue import qualified	BishBosh.Property.FixedMembership	as Property.FixedMembership+import qualified	BishBosh.Type.Count			as Type.Count import qualified	Control.DeepSeq import qualified	Control.Exception import qualified	Data.Array.IArray@@ -104,17 +105,16 @@ 	index (lower, upper)		= Control.Exception.assert (lower == minBound && upper == maxBound) . fromEnum  instance Show Rank where-	showsPrec _	= showChar . \case-		Pawn	-> 'p'-		Rook	-> 'r'-		Knight	-> 'n'-		Bishop	-> 'b'-		Queen	-> 'q'-		King	-> 'k'+	show Pawn	= "p"+	show Rook	= "r"+	show Knight	= "n"+	show Bishop	= "b"+	show Queen	= "q"+	show King	= "k"  instance Read Rank where-	readsPrec _ (c : s)-		| Data.Char.isSpace c	= reads s	-- Consume.+	readsPrec precedence (c : s)+		| Data.Char.isSpace c	= readsPrec precedence s	-- Consume. 		| otherwise		= map (flip (,) s) $ case Data.Char.toLower c of 			'p'	-> [Pawn] 			'r'	-> [Rook]@@ -180,7 +180,7 @@ expendable	= Data.List.delete King range  -- | The type of a function which returns a /rank/'s value.-type EvaluateRank rankValue	= Rank -> rankValue+type EvaluateRank	= Rank -> Metric.RankValue.RankValue  {- | 	* Given two alternative capture moves, this function compares the rank-value of the aggressors.@@ -188,8 +188,7 @@ 	* N.B.: a @King@ is always considered most valuable, regardless of the evaluation-function supplied. -} compareByLVA-	:: Ord rankValue-	=> EvaluateRank rankValue+	:: EvaluateRank 	-> Rank 	-> Rank 	-> Ordering@@ -199,12 +198,13 @@ 	| rankR == King		= LT 	| otherwise		= Data.Ord.comparing evaluateRank rankL rankR --- | A number of ranks.-type NRanks	= Int- -- | The constant number of distinct /rank/s.-nDistinctRanks :: NRanks-nDistinctRanks	= length range+nDistinctRanks :: Type.Count.NRanks+nDistinctRanks	= fromIntegral $ length range++-- | The number of each rank allocated to each side.+allocationPerSide :: ArrayByRank Type.Count.NRanks+allocationPerSide	= listArrayByRank [8, 2, 2, 2, 1, 1]  -- | A boxed array indexed by /rank/, of arbitrary values. type ArrayByRank	= Data.Array.IArray.Array Rank

@@ -1,142 +0,0 @@-{--	Copyright (C) 2018 Dr. Alistair Ward--	This file is part of BishBosh.--	BishBosh 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 3 of the License, or-	(at your option) any later version.--	BishBosh 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 BishBosh.  If not, see <http://www.gnu.org/licenses/>.--}-{- |- [@AUTHOR@]	Dr. Alistair Ward-- [@DESCRIPTION@]--	* The relative values of the various /rank/s of chess-piece.--	* <https://en.wikipedia.org/wiki/Chess_piece_relative_value#Hans_Berliner.27s_system%20Chess-piece%20relative%20values>--}--module BishBosh.Attribute.RankValues(--- * Types--- ** Data-types-	RankValues(),--- * Constants-	tag,--- * Functions-	findRankValue,-	calculateMaximumTotalValue,--- ** Constructor-	fromAssocs-) where--import			Control.Arrow((&&&), (***))-import			Data.Array.IArray((!))-import qualified	BishBosh.Attribute.Rank		as Attribute.Rank-import qualified	BishBosh.Data.Exception		as Data.Exception-import qualified	BishBosh.Data.Foldable		as Data.Foldable-import qualified	BishBosh.Data.Num		as Data.Num-import qualified	BishBosh.Property.ShowFloat	as Property.ShowFloat-import qualified	BishBosh.Text.ShowList		as Text.ShowList-import qualified	Control.Arrow-import qualified	Control.DeepSeq-import qualified	Control.Exception-import qualified	Data.Array.IArray-import qualified	Data.Default-import qualified	Data.List-import qualified	Text.XML.HXT.Arrow.Pickle	as HXT---- | Used to qualify XML.-tag :: String-tag	= "rankValues"--{- |-	* The constant value associated with each /rank/; the higher, the more valuable it is considered to be.--	* N.B.: only relative values are significant; the absolute value associated with any /rank/ is irrelevant; typically ranks are valued in /centipawns/.--	* CAVEAT: a @King@ can never be taken, but assigning the value /infinity/ creates problems, so typically it has the value @0@.--}-newtype RankValues rankValue	= MkRankValues {-	deconstruct	:: Attribute.Rank.ArrayByRank rankValue-} deriving (Eq, Read, Show)--instance Real rankValue => Property.ShowFloat.ShowFloat (RankValues rankValue) where-	showsFloat fromDouble	= Text.ShowList.showsAssociationList' . map (show *** fromDouble . realToFrac) . Data.Array.IArray.assocs . deconstruct--instance (-	Fractional	rankValue,-	Ord		rankValue,-	Show		rankValue- ) => Data.Default.Default (RankValues rankValue) where-	def = fromAssocs $ map (-		Control.Arrow.second (/ 10)	-- Map into the closed unit-interval.-	 ) [-		(-			Attribute.Rank.Pawn,	1-		), (-			Attribute.Rank.Rook,	5-		), (-			Attribute.Rank.Knight,	3-		), (-			Attribute.Rank.Bishop,	3-		), (-			Attribute.Rank.Queen,	9-		), (-			Attribute.Rank.King,	0	-- N.B.: move-selection is independent of this value (since it can't be taken), so it can be defined arbitrarily.-		)-	 ]--instance Control.DeepSeq.NFData rankValue => Control.DeepSeq.NFData (RankValues rankValue) where-	rnf (MkRankValues byRank)	= Control.DeepSeq.rnf byRank--instance (-	Fractional	rankValue,-	HXT.XmlPickler	rankValue,-	Ord		rankValue,-	Show		rankValue- ) => HXT.XmlPickler (RankValues rankValue) where-	xpickle	= HXT.xpDefault Data.Default.def . HXT.xpWrap (-		fromAssocs,				-- Construct from an association-list.-		Data.Array.IArray.assocs . deconstruct	-- Deconstruct to an association-list.-	 ) . HXT.xpList1 . HXT.xpElem tag $ HXT.xpickle {-rank-} `HXT.xpPair` HXT.xpAttr "value" HXT.xpickle---- | Smart-constructor.-fromAssocs :: (-	Fractional	rankValue,-	Ord		rankValue,-	Show		rankValue- ) => [(Attribute.Rank.Rank, rankValue)] -> RankValues rankValue-fromAssocs assocs-	| not $ null undefinedRanks	= Control.Exception.throw . Data.Exception.mkInsufficientData . showString "BishBosh.Attribute.RankValues.fromAssocs:\tranks" . Text.ShowList.showsAssociation $ shows undefinedRanks " are undefined."-	| not $ null duplicateRanks	= Control.Exception.throw . Data.Exception.mkDuplicateData . showString "BishBosh.Attribute.RankValues.fromAssocs:\tranks must be distinct; " $ shows duplicateRanks "."-	| not $ all (-		Data.Num.inClosedUnitInterval . snd {-rank-value-}-	) assocs			= Control.Exception.throw . Data.Exception.mkOutOfBounds . showString "BishBosh.Attribute.RankValues.fromAssocs:\tall values must be within the closed unit-interval, [0,1]; " $ shows assocs "."-	| otherwise			= MkRankValues $ Attribute.Rank.arrayByRank assocs-	where-		(undefinedRanks, duplicateRanks)	= Attribute.Rank.findUndefinedRanks &&& Data.Foldable.findDuplicates $ map fst assocs---- | Query.-findRankValue :: Attribute.Rank.Rank -> RankValues rankValue -> rankValue-findRankValue rank (MkRankValues byRank)	= byRank ! rank--{- |-	* The maximum total rank-value one side can have.--	* CAVEAT: assumes that zero pieces have been captured, all @Pawn@s have been queened, & that this is the most valuable /rank/ of /piece/.--}-calculateMaximumTotalValue :: Num rankValue => RankValues rankValue -> rankValue-calculateMaximumTotalValue (MkRankValues byRank)	= 9 {-accounting for all possible promotions-} * (byRank ! Attribute.Rank.Queen) + 2 * Data.List.foldl' (-	\acc -> (+ acc) . (byRank !)- ) 0 Attribute.Rank.flank-

@@ -1,83 +0,0 @@-{--	Copyright (C) 2018 Dr. Alistair Ward--	This file is part of BishBosh.--	BishBosh 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 3 of the License, or-	(at your option) any later version.--	BishBosh 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 BishBosh.  If not, see <http://www.gnu.org/licenses/>.--}-{- |- [@AUTHOR@]	Dr. Alistair Ward-- [@DESCRIPTION@]	The unweighted values of each criterion used to assess the fitness of a position, & the resulting weighted mean.--}--module BishBosh.Attribute.WeightedMeanAndCriterionValues(--- * Types--- ** Data-types-	WeightedMeanAndCriterionValues(---		MkWeightedMeanAndCriterionValues,-		getWeightedMean,-		getCriterionValues-	),--- * Constants-	criterionValuesTag,-	weightedMeanTag,--- * Functions-	negateWeightedMean,--- ** Constructor-	mkWeightedMeanAndCriterionValues-) where--import qualified	BishBosh.Property.ShowFloat	as Property.ShowFloat-import qualified	BishBosh.Text.ShowList		as Text.ShowList-import qualified	Control.DeepSeq---- | Qualifies output.-criterionValuesTag :: String-criterionValuesTag	= "criterion-values"---- | Qualifies output.-weightedMeanTag :: String-weightedMeanTag		= "weighted-mean"---- | A /weighted mean/ & the individual unweighted criterion-values from which it was composed.-data WeightedMeanAndCriterionValues weightedMean criterionValue	= MkWeightedMeanAndCriterionValues {-	getWeightedMean		:: weightedMean,	-- ^ The weighted mean of a list of criterion-values.-	getCriterionValues	:: [criterionValue]	-- ^ The unweighted 'Attribute.CriterionValue.CriterionValue's from which the weighted mean was composed.-} deriving (Eq, Show)--instance Control.DeepSeq.NFData weightedMean => Control.DeepSeq.NFData (WeightedMeanAndCriterionValues weightedMean criterionValue) where-	rnf MkWeightedMeanAndCriterionValues { getWeightedMean = weightedMean }	= Control.DeepSeq.rnf weightedMean	-- The other field is a prerequisite.--instance (Real criterionValue, Real weightedMean) => Property.ShowFloat.ShowFloat (WeightedMeanAndCriterionValues weightedMean criterionValue) where-	showsFloat fromDouble MkWeightedMeanAndCriterionValues {-		getWeightedMean		= weightedMean,-		getCriterionValues	= criterionValues-	} = Text.ShowList.showsAssociationList' [-		(weightedMeanTag, fromDouble $ realToFrac weightedMean),-		(criterionValuesTag, Text.ShowList.showsFormattedList' (fromDouble . realToFrac) criterionValues)-	 ]---- | Constructor.-mkWeightedMeanAndCriterionValues :: weightedMean -> [criterionValue] -> WeightedMeanAndCriterionValues weightedMean criterionValue-mkWeightedMeanAndCriterionValues	= MkWeightedMeanAndCriterionValues--{- |-	* Negate the /weightedMean/, but leave the criterion-values unaltered.--	* This can be used to assess the fitness of a position from the perspective of one's opponent.--}-negateWeightedMean :: Num weightedMean => WeightedMeanAndCriterionValues weightedMean criterionValue -> WeightedMeanAndCriterionValues weightedMean criterionValue-negateWeightedMean weightedMeanAndCriterionValues@MkWeightedMeanAndCriterionValues { getWeightedMean = weightedMean }	= weightedMeanAndCriterionValues { getWeightedMean = negate weightedMean }-

@@ -52,7 +52,7 @@ ) where  import qualified	BishBosh.Data.Enum	as Data.Enum-import qualified	BishBosh.Types		as T+import qualified	BishBosh.Type.Length	as Type.Length import qualified	Control.Exception import qualified	Data.Array.IArray @@ -61,7 +61,7 @@ xOrigin	= 0  -- | The constant length of the /x/-axis.-xLength :: T.Distance+xLength :: Type.Length.Distance xLength	= 8  -- | The constant lower bound of abscissae.

@@ -92,7 +92,7 @@ import qualified	BishBosh.Property.Reflectable			as Property.Reflectable import qualified	BishBosh.Property.Rotatable			as Property.Rotatable import qualified	BishBosh.Text.ShowList				as Text.ShowList-import qualified	BishBosh.Types					as T+import qualified	BishBosh.Type.Length				as Type.Length import qualified	Control.DeepSeq import qualified	Control.Exception import qualified	Data.Array.IArray@@ -122,7 +122,7 @@ 	rnf MkCoordinates { getX = x, getY = y }	= Control.DeepSeq.rnf (x, y)  instance (Show x, Show y) => Show (Coordinates x y) where-	showsPrec _ MkCoordinates { getX = x, getY = y }	= shows (x, y)+	showsPrec precedence MkCoordinates { getX = x, getY = y }	= showsPrec precedence (x, y)  instance ( 	Enum	x,@@ -132,14 +132,14 @@ 	Read	x, 	Read	y  ) => Read (Coordinates x y) where-	readsPrec _ s	= [+	readsPrec precedence s	= [ 		(coordinates, remainder) |-			((x, y), remainder)	<- reads s,+			((x, y), remainder)	<- readsPrec precedence s, 			coordinates		<- Data.Maybe.maybeToList $ mkMaybeCoordinates x y 	 ] -- List-comprehension.  instance (Ord x, Ord y) => Ord (Coordinates x y) where-	{-# SPECIALISE instance Ord (Coordinates T.X T.Y) #-}+	{-# SPECIALISE instance Ord (Coordinates Type.Length.X Type.Length.Y) #-} 	MkCoordinates { getX = x, getY = y } `compare` MkCoordinates { getX = x', getY = y' }	= (y, x) `compare` (y', x')	-- N.B.: x is less significant than y, as required by the implementation of 'Data.Array.IArray.Ix.inRange'.  instance (Enum x, Enum y) => Bounded (Coordinates x y) where@@ -158,7 +158,7 @@ 	Ord	x, 	Ord	y  ) => Data.Array.IArray.Ix (Coordinates x y) where-	{-# SPECIALISE instance Data.Array.IArray.Ix (Coordinates T.X T.Y) #-}+	{-# SPECIALISE instance Data.Array.IArray.Ix (Coordinates Type.Length.X Type.Length.Y) #-} 	range (lower, upper)			= Control.Exception.assert (lower == minBound && upper == maxBound) Property.FixedMembership.members 	inRange (lower, upper) coordinates	= Control.Exception.assert (coordinates >= lower && coordinates <= upper) True 	index (lower, upper)			= Control.Exception.assert (lower == minBound && upper == maxBound) . toIx@@ -193,7 +193,7 @@ nSquares	= fromIntegral $ Cartesian.Abscissa.xLength * Cartesian.Ordinate.yLength  instance (Enum x, Enum y) => Property.FixedMembership.FixedMembership (Coordinates x y) where-	{-# SPECIALISE instance Property.FixedMembership.FixedMembership (Coordinates T.X T.Y) #-}+	{-# SPECIALISE instance Property.FixedMembership.FixedMembership (Coordinates Type.Length.X Type.Length.Y) #-} 	members	= [ 		MkCoordinates { 			getX	= x,@@ -244,7 +244,7 @@  -- | Convert to an array-index. toIx :: (Enum x, Enum y) => Coordinates x y -> Int-{-# SPECIALISE toIx :: Coordinates T.X T.Y -> Int #-}+{-# SPECIALISE toIx :: Coordinates Type.Length.X Type.Length.Y -> Int #-} toIx MkCoordinates { 	getX	= x, 	getY	= y@@ -426,7 +426,7 @@ extrapolate	= extrapolate'  -- | A specialisation of 'extrapolate'.-extrapolateInt :: Attribute.Direction.Direction -> Coordinates T.X T.Y -> [Coordinates T.X T.Y]+extrapolateInt :: Attribute.Direction.Direction -> Coordinates Type.Length.X Type.Length.Y -> [Coordinates Type.Length.X Type.Length.Y] extrapolateInt direction coordinates	= extrapolationsByDirectionByCoordinates ! coordinates ! direction  -- | The constant lists of /coordinates/, extrapolated from every /coordinate/ in the /board/, in every /direction/.@@ -440,7 +440,7 @@ 	Ord			x, 	Ord			y  ) => ArrayByCoordinates x y (Attribute.Direction.ArrayByDirection [Coordinates x y])-{-# SPECIALISE extrapolationsByDirectionByCoordinates :: ArrayByCoordinates T.X T.Y (Attribute.Direction.ArrayByDirection [Coordinates T.X T.Y]) #-}	-- To promote memoisation.+{-# SPECIALISE extrapolationsByDirectionByCoordinates :: ArrayByCoordinates Type.Length.X Type.Length.Y (Attribute.Direction.ArrayByDirection [Coordinates Type.Length.X Type.Length.Y]) #-}	-- To promote memoisation. extrapolationsByDirectionByCoordinates	= listArrayByCoordinates #ifdef USE_PARALLEL 	. Control.Parallel.Strategies.withStrategy (Control.Parallel.Strategies.parList Control.Parallel.Strategies.rdeepseq)@@ -460,7 +460,7 @@ 	Ord			x, 	Ord			y  ) => ArrayByCoordinates x y (Data.Map.Map (Coordinates x y) [Coordinates x y])-{-# SPECIALISE interpolationsByDestinationBySource :: ArrayByCoordinates T.X T.Y (Data.Map.Map (Coordinates T.X T.Y) [Coordinates T.X T.Y]) #-}	-- To promote memoisation.+{-# SPECIALISE interpolationsByDestinationBySource :: ArrayByCoordinates Type.Length.X Type.Length.Y (Data.Map.Map (Coordinates Type.Length.X Type.Length.Y) [Coordinates Type.Length.X Type.Length.Y]) #-}	-- To promote memoisation. interpolationsByDestinationBySource	= Data.Array.IArray.amap ( 	Data.Map.fromList . map ( 		last {-destination-} &&& id {-interpolation-}@@ -496,7 +496,7 @@ 	| otherwise		= Control.Exception.assert ( 		x == x' || y == y' || ( 			let-				distanceX, distanceY :: T.Distance+				distanceX, distanceY :: Type.Length.Distance 				(distanceX, distanceY)	= measureDistance source destination 			in abs distanceX == abs distanceY 		) -- Check that the move is straight.@@ -509,7 +509,7 @@ 			EQ	-> repeat fromAfter  -- | A specialisation of 'interpolate'.-interpolateInt :: Coordinates T.X T.Y -> Coordinates T.X T.Y -> [Coordinates T.X T.Y]+interpolateInt :: Coordinates Type.Length.X Type.Length.Y -> Coordinates Type.Length.X Type.Length.Y -> [Coordinates Type.Length.X Type.Length.Y] interpolateInt coordinatesSource coordinatesDestination	= interpolationsByDestinationBySource ! coordinatesSource Data.Map.! coordinatesDestination  -- | The type of a function which changes one set of /coordinates/ to another.@@ -540,7 +540,7 @@ 	} -- -90 degrees, i.e. clockwise. 	_		-> Control.Exception.throw . Data.Exception.mkRequestFailure . showString "BishBosh.Cartesian.Coordinates.rotate:\tunable to rotate to direction" . Text.ShowList.showsAssociation $ shows direction "." 	where-		xDistance, xDistance', yDistance, yDistance'	:: T.Distance+		xDistance, xDistance', yDistance, yDistance'	:: Type.Length.Distance 		xDistance	= fromIntegral $ Cartesian.Abscissa.toIx x 		yDistance	= fromIntegral $ Cartesian.Ordinate.toIx y 		xDistance'	= pred Cartesian.Abscissa.xLength - xDistance@@ -576,7 +576,7 @@ 	| even $ uncurry (+) distance	= Attribute.LogicalColourOfSquare.black 	| otherwise			= Attribute.LogicalColourOfSquare.white 	where-		distance :: (T.Distance, T.Distance)+		distance :: (Type.Length.Distance, Type.Length.Distance) 		distance	= measureDistance minBound coordinates  -- | Whether the specified squares have the same /logical colour/.

@@ -58,7 +58,7 @@ import qualified	BishBosh.Cartesian.Abscissa		as Cartesian.Abscissa import qualified	BishBosh.Data.Enum			as Data.Enum import qualified	BishBosh.Property.Opposable		as Property.Opposable-import qualified	BishBosh.Types				as T+import qualified	BishBosh.Type.Length			as Type.Length import qualified	Control.Exception import qualified	Data.Array.IArray @@ -67,7 +67,7 @@ yOrigin	= Cartesian.Abscissa.xOrigin	-- N.B. it doesn't need to be the same.  -- | The constant length of the /y/-axis.-yLength :: T.Distance+yLength :: Type.Length.Distance yLength	= Cartesian.Abscissa.xLength	-- Because the board is square.  -- | The constant lower bound of ordinates.

@@ -63,7 +63,7 @@ import qualified	BishBosh.Data.Enum			as Data.Enum import qualified	BishBosh.Property.Opposable		as Property.Opposable import qualified	BishBosh.Property.Orientated		as Property.Orientated-import qualified	BishBosh.Types				as T+import qualified	BishBosh.Type.Length			as Type.Length import qualified	Control.DeepSeq import qualified	Control.Exception @@ -116,7 +116,7 @@ isStraight vector	= isParallel vector || isDiagonal vector  -- | A suitable concrete type.-type VectorInt	= Vector T.Distance+type VectorInt	= Vector Type.Length.Distance  instance Control.DeepSeq.NFData	distance => Control.DeepSeq.NFData (Vector distance) where 	rnf MkVector { getXDistance = xDistance, getYDistance = yDistance }	= Control.DeepSeq.rnf (xDistance, yDistance)@@ -230,7 +230,7 @@ 	=> Cartesian.Coordinates.Coordinates x y 	-> Vector distance 	-> Maybe (Cartesian.Coordinates.Coordinates x y)-{-# SPECIALISE maybeTranslate :: Cartesian.Coordinates.Coordinates T.X T.Y -> Vector T.Distance -> Maybe (Cartesian.Coordinates.Coordinates T.X T.Y) #-}+{-# SPECIALISE maybeTranslate :: Cartesian.Coordinates.Coordinates Type.Length.X Type.Length.Y -> Vector Type.Length.Distance -> Maybe (Cartesian.Coordinates.Coordinates Type.Length.X Type.Length.Y) #-} maybeTranslate coordinates (MkVector xDistance yDistance)	= Cartesian.Coordinates.maybeTranslate ( 	Data.Enum.translate (+ fromIntegral xDistance) *** Data.Enum.translate (+ fromIntegral yDistance)  ) coordinates

@@ -51,7 +51,7 @@ import qualified	BishBosh.Data.Enum			as Data.Enum import qualified	BishBosh.Data.Exception			as Data.Exception import qualified	BishBosh.Property.FixedMembership	as Property.FixedMembership-import qualified	BishBosh.Types				as T+import qualified	BishBosh.Type.Length			as Type.Length import qualified	Control.Exception  -- | Defines a castling-move.@@ -121,7 +121,7 @@ getCastlingMoves	= defineCastlingMoves  -- | A specialisation of 'getCastlingMoves'.-getCastlingMovesInt :: Attribute.LogicalColour.LogicalColour -> [CastlingMove T.X T.Y]+getCastlingMovesInt :: Attribute.LogicalColour.LogicalColour -> [CastlingMove Type.Length.X Type.Length.Y] getCastlingMovesInt	= (castlingMovesByLogicalColour !)  -- | Break-down the two castling-moves for the specified /logical colour/ into a long & a short castling-move.@@ -131,7 +131,7 @@ 	Eq	y, 	Ord	x  ) => Attribute.LogicalColour.LogicalColour -> (CastlingMove x y, CastlingMove x y)-{-# SPECIALISE getLongAndShortMoves :: Attribute.LogicalColour.LogicalColour -> (CastlingMove T.X T.Y, CastlingMove T.X T.Y) #-}+{-# SPECIALISE getLongAndShortMoves :: Attribute.LogicalColour.LogicalColour -> (CastlingMove Type.Length.X Type.Length.Y, CastlingMove Type.Length.X Type.Length.Y) #-} getLongAndShortMoves logicalColour 	| [longCastlingMove, shortCastlingMove] <- getCastlingMoves logicalColour	= (longCastlingMove, shortCastlingMove) 	| otherwise									= Control.Exception.throw $ Data.Exception.mkIncompatibleData "BishBosh.Component.CastlingMove.getLongAndShortMoves:\tunexpected list-length."

@@ -25,8 +25,6 @@ module BishBosh.Component.Move( -- * Types -- ** Type-synonyms-	NMoves,-	NPlies, 	Move( --		MkMove, 		getSource,@@ -50,7 +48,8 @@ import qualified	BishBosh.Property.Opposable		as Property.Opposable import qualified	BishBosh.Property.Orientated		as Property.Orientated import qualified	BishBosh.Property.Reflectable		as Property.Reflectable-import qualified	BishBosh.Types				as T+import qualified	BishBosh.Type.Count			as Type.Count+import qualified	BishBosh.Type.Length			as Type.Length import qualified	Control.Arrow import qualified	Control.DeepSeq import qualified	Control.Exception@@ -60,14 +59,8 @@ tag :: String tag	= "move" --- | A number of moves.-type NMoves	= Int---- | A number of half-moves into a /game/.-type NPlies	= NMoves- -- | The constant number of plies per move.-nPliesPerMove :: NPlies+nPliesPerMove :: Type.Count.NPlies nPliesPerMove	= 2  {- |@@ -81,7 +74,7 @@ } deriving Eq  instance (Ord x, Ord y) => Ord (Move x y) where-	{-# SPECIALISE instance Ord (Move T.X T.Y) #-}+	{-# SPECIALISE instance Ord (Move Type.Length.X Type.Length.Y) #-} 	move@MkMove { getSource = source } `compare` move'@MkMove { getSource = source' }	= case source `compare` source' of 		EQ		-> Data.Ord.comparing getDestination move move' 		ordering	-> ordering@@ -93,10 +86,10 @@ 	} = Control.DeepSeq.rnf (source, destination)  instance (Show x, Show y) => Show (Move x y) where-	showsPrec _ MkMove {+	showsPrec precedence MkMove { 		getSource	= source, 		getDestination	= destination-	} = shows (source, destination)+	} = showsPrec precedence (source, destination)  instance ( 	Enum	x,@@ -106,7 +99,7 @@ 	Read	x, 	Read	y  ) => Read (Move x y) where-	readsPrec _	= map (Control.Arrow.first $ uncurry mkMove) . reads+	readsPrec precedence	= map (Control.Arrow.first $ uncurry mkMove) . readsPrec precedence  instance Property.Opposable.Opposable (Move x y) where 	getOpposite (MkMove source destination)	= MkMove {@@ -155,7 +148,7 @@ 	Num	distance, 	Ord	distance  ) => Move x y -> Cartesian.Vector.Vector distance-{-# SPECIALISE measureDistance :: Move T.X T.Y -> Cartesian.Vector.VectorInt #-}+{-# SPECIALISE measureDistance :: Move Type.Length.X Type.Length.Y -> Cartesian.Vector.VectorInt #-} measureDistance	MkMove { 	getSource	= source, 	getDestination	= destination@@ -168,7 +161,7 @@ 	Ord	x, 	Ord	y  ) => Move x y -> [Cartesian.Coordinates.Coordinates x y]-{-# SPECIALISE interpolate :: Move T.X T.Y -> [Cartesian.Coordinates.Coordinates T.X T.Y] #-}+{-# SPECIALISE interpolate :: Move Type.Length.X Type.Length.Y -> [Cartesian.Coordinates.Coordinates Type.Length.X Type.Length.Y] #-} interpolate move@MkMove { 	getSource	= source, 	getDestination	= destination

@@ -27,7 +27,6 @@ module BishBosh.Component.Piece( -- * Types -- ** Type-synonyms-	NPieces, --	ByRankByLogicalColour, --	AttackDestinationsByCoordinatesByRankByLogicalColour, --	ArrayByPiece,@@ -92,7 +91,8 @@ import qualified	BishBosh.Property.FixedMembership		as Property.FixedMembership import qualified	BishBosh.Property.ForsythEdwards		as Property.ForsythEdwards import qualified	BishBosh.Property.Opposable			as Property.Opposable-import qualified	BishBosh.Types					as T+import qualified	BishBosh.Type.Count				as Type.Count+import qualified	BishBosh.Type.Length				as Type.Length import qualified	Control.DeepSeq import qualified	Control.Exception import qualified	Data.Array.IArray@@ -111,12 +111,9 @@ tag :: String tag	= "piece" --- | A number of /piece/s.-type NPieces	= Int	-- N.B.: 'Data.Int.Int8' saves neither time nor space.- -- | The initial number of pieces per side in a standard opening position; some of which are duplicates.-nPiecesPerSide :: NPieces-nPiecesPerSide	= fromIntegral Cartesian.Abscissa.xLength * 2 {-rows-}+nPiecesPerSide :: Type.Count.NPieces+nPiecesPerSide	= fromIntegral $ Cartesian.Abscissa.xLength * 2 {-rows-}  -- | A Chess-piece has a /logical colour/ & a /rank/. data Piece	= MkPiece {@@ -136,7 +133,7 @@ 	index (lower, upper) MkPiece { 		getLogicalColour	= logicalColour, 		getRank			= rank-	} = Control.Exception.assert (lower == minBound && upper == maxBound) $ fromEnum logicalColour * Attribute.Rank.nDistinctRanks + fromEnum rank+	} = Control.Exception.assert (lower == minBound && upper == maxBound) $ fromEnum logicalColour * fromIntegral Attribute.Rank.nDistinctRanks + fromEnum rank  instance Read Piece where 	readsPrec _	= Property.ForsythEdwards.readsFEN@@ -287,7 +284,7 @@ 	Ord			x, 	Ord			y  ) => AttackDestinationsByCoordinatesByRankByLogicalColour x y-{-# SPECIALISE attackDestinationsByCoordinatesByRankByLogicalColour :: AttackDestinationsByCoordinatesByRankByLogicalColour T.X T.Y #-}	-- To promote memoisation.+{-# SPECIALISE attackDestinationsByCoordinatesByRankByLogicalColour :: AttackDestinationsByCoordinatesByRankByLogicalColour Type.Length.X Type.Length.Y #-}	-- To promote memoisation. attackDestinationsByCoordinatesByRankByLogicalColour	= mkByRankByLogicalColour Attribute.Rank.fixedAttackRange $ \logicalColour rank -> Cartesian.Coordinates.listArrayByCoordinates $ map ( 	`findAttackDestinations'` mkPiece logicalColour rank  ) Property.FixedMembership.members@@ -326,7 +323,7 @@ findAttackDestinations	= findAttackDestinations'  -- | A specialisation of 'findAttackDestinations', more efficiently implemented by calling 'attackDestinationsByCoordinatesByRankByLogicalColour'.-findAttackDestinationsInt :: Cartesian.Coordinates.Coordinates T.X T.Y -> Piece -> [Cartesian.Coordinates.Coordinates T.X T.Y]+findAttackDestinationsInt :: Cartesian.Coordinates.Coordinates Type.Length.X Type.Length.Y -> Piece -> [Cartesian.Coordinates.Coordinates Type.Length.X Type.Length.Y] findAttackDestinationsInt coordinates MkPiece { 	getLogicalColour	= logicalColour, 	getRank			= rank@@ -373,7 +370,7 @@ 	-> Cartesian.Coordinates.Coordinates x y	-- ^ Destination (victim's location). 	-> Piece					-- ^ Attacker. 	-> Bool-{-# SPECIALISE canAttackAlong :: Cartesian.Coordinates.Coordinates T.X T.Y -> Cartesian.Coordinates.Coordinates T.X T.Y -> Piece -> Bool #-}+{-# SPECIALISE canAttackAlong :: Cartesian.Coordinates.Coordinates Type.Length.X Type.Length.Y -> Cartesian.Coordinates.Coordinates Type.Length.X Type.Length.Y -> Piece -> Bool #-} canAttackAlong source destination piece	= ( 	case getRank piece of 		Attribute.Rank.Pawn	-> Cartesian.Vector.isPawnAttack $ getLogicalColour piece@@ -400,7 +397,7 @@ 	-> Cartesian.Coordinates.Coordinates x y	-- ^ Destination. 	-> Piece 	-> Bool-{-# SPECIALISE canMoveBetween :: Cartesian.Coordinates.Coordinates T.X T.Y -> Cartesian.Coordinates.Coordinates T.X T.Y -> Piece -> Bool #-}+{-# SPECIALISE canMoveBetween :: Cartesian.Coordinates.Coordinates Type.Length.X Type.Length.Y -> Cartesian.Coordinates.Coordinates Type.Length.X Type.Length.Y -> Piece -> Bool #-} canMoveBetween source destination piece	= ( 	case getRank piece of 		Attribute.Rank.Pawn	-> \distance -> let

@@ -46,7 +46,7 @@ 	mkPieceSquareByCoordinatesByRank ) where -import			Control.Arrow((&&&))+import			Control.Arrow((&&&), (|||)) import			Data.Array.IArray((!)) import qualified	BishBosh.Attribute.LogicalColour	as Attribute.LogicalColour import qualified	BishBosh.Attribute.Rank			as Attribute.Rank@@ -56,17 +56,22 @@ import qualified	BishBosh.Property.FixedMembership	as Property.FixedMembership import qualified	BishBosh.Property.Reflectable		as Property.Reflectable import qualified	BishBosh.Text.ShowList			as Text.ShowList-import qualified	BishBosh.Types				as T+import qualified	BishBosh.Type.Count			as Type.Count+import qualified	BishBosh.Type.Length			as Type.Length+import qualified	BishBosh.Type.Mass			as Type.Mass import qualified	Control.DeepSeq import qualified	Data.Array.IArray import qualified	Data.List  -- | The piece-square value may vary as the game progresses.-type PieceSquareValueByNPieces pieceSquareValue	= Data.Array.IArray.Array Component.Piece.NPieces pieceSquareValue+type PieceSquareValueByNPieces pieceSquareValue	= Data.Array.IArray.Array Type.Count.NPieces pieceSquareValue  -- | The bounds of the number of pieces on the board, at the end-game & opening-game respectively.-nPiecesBounds :: (Component.Piece.NPieces, Component.Piece.NPieces)-nPiecesBounds	= (3 {-minimum sufficient material-}, Attribute.LogicalColour.nDistinctLogicalColours * Component.Piece.nPiecesPerSide)+nPiecesBounds :: (Type.Count.NPieces, Type.Count.NPieces)+nPiecesBounds	= (+	3 {-minimum sufficient material-},+	fromIntegral Attribute.LogicalColour.nDistinctLogicalColours * Component.Piece.nPiecesPerSide+ )  -- | Self-documentation. type EitherPieceSquareValueByNPiecesByCoordinates x y pieceSquareValue	= Either (@@ -107,24 +112,24 @@ 	Ord	x, 	Ord	y  )-	=> Component.Piece.NPieces			-- ^ The progress through the game.+	=> Type.Count.NPieces				-- ^ The progress through the game. 	-> Attribute.LogicalColour.LogicalColour	-- ^ The /piece/'s /logical colour/. 	-> Attribute.Rank.Rank				-- ^ The /piece/'s /rank/. 	-> Cartesian.Coordinates.Coordinates x y	-- ^ The /piece/'s location. 	-> PieceSquareByCoordinatesByRank x y pieceSquareValue 	-> pieceSquareValue {-# SPECIALISE findPieceSquareValue-	:: Component.Piece.NPieces+	:: Type.Count.NPieces 	-> Attribute.LogicalColour.LogicalColour 	-> Attribute.Rank.Rank-	-> Cartesian.Coordinates.Coordinates T.X T.Y-	-> PieceSquareByCoordinatesByRank T.X T.Y T.PieceSquareValue-	-> T.PieceSquareValue+	-> Cartesian.Coordinates.Coordinates Type.Length.X Type.Length.Y+	-> PieceSquareByCoordinatesByRank Type.Length.X Type.Length.Y Type.Mass.PieceSquareValue+	-> Type.Mass.PieceSquareValue  #-}-findPieceSquareValue nPieces logicalColour rank coordinates MkPieceSquareByCoordinatesByRank { deconstruct = byRank }	= either (!) (-	\byNPiecesByCoordinates	-> (! nPieces) . (byNPiecesByCoordinates !)- ) (-	byRank ! rank+findPieceSquareValue nPieces logicalColour rank coordinates MkPieceSquareByCoordinatesByRank { deconstruct = byRank }	= (+	(!) ||| (+		\byNPiecesByCoordinates	-> (! nPieces) . (byNPiecesByCoordinates !)+	) $ byRank ! rank  ) $ ( 	if Attribute.LogicalColour.isBlack logicalColour 		then Property.Reflectable.reflectOnX@@ -145,24 +150,24 @@ 	Ord	x, 	Ord	y  )-	=> Component.Piece.NPieces			-- ^ The progress through the game.+	=> Type.Count.NPieces				-- ^ The progress through the game. 	-> Attribute.LogicalColour.LogicalColour	-- ^ The /piece/'s /logical colour/. 	-> Attribute.Rank.Rank				-- ^ The /piece/'s /rank/. 	-> [Cartesian.Coordinates.Coordinates x y]	-- ^ The locations of interest for the specified /piece/. 	-> PieceSquareByCoordinatesByRank x y pieceSquareValue 	-> [pieceSquareValue] {-# SPECIALISE findPieceSquareValues-	:: Component.Piece.NPieces+	:: Type.Count.NPieces 	-> Attribute.LogicalColour.LogicalColour 	-> Attribute.Rank.Rank-	-> [Cartesian.Coordinates.Coordinates T.X T.Y]-	-> PieceSquareByCoordinatesByRank T.X T.Y T.PieceSquareValue-	-> [T.PieceSquareValue]+	-> [Cartesian.Coordinates.Coordinates Type.Length.X Type.Length.Y]+	-> PieceSquareByCoordinatesByRank Type.Length.X Type.Length.Y Type.Mass.PieceSquareValue+	-> [Type.Mass.PieceSquareValue]  #-}-findPieceSquareValues nPieces logicalColour rank coordinatesList MkPieceSquareByCoordinatesByRank { deconstruct = byRank }	= either (!) (-	\byNPiecesByCoordinates	-> (! nPieces) . (byNPiecesByCoordinates !)- ) (-	byRank ! rank+findPieceSquareValues nPieces logicalColour rank coordinatesList MkPieceSquareByCoordinatesByRank { deconstruct = byRank }	= (+	(!) ||| (+		\byNPiecesByCoordinates	-> (! nPieces) . (byNPiecesByCoordinates !)+	) $ byRank ! rank  ) `map` ( 	if Attribute.LogicalColour.isBlack logicalColour 		then map Property.Reflectable.reflectOnX@@ -218,11 +223,9 @@ 			else id 	) . showS  ) id . zip (-	Property.FixedMembership.members	:: [Cartesian.Coordinates.Coordinates T.X T.Y]+	Property.FixedMembership.members	:: [Cartesian.Coordinates.Coordinates Type.Length.X Type.Length.Y]  ) . Data.List.transpose . map (-	Data.Array.IArray.elems `either` (-		map selector {-select one pieceSquareValue from interpolated values-} . Data.Array.IArray.elems {-ByCoordinates-}-	)+	Data.Array.IArray.elems ||| map selector {-select one pieceSquareValue from interpolated values-} . Data.Array.IArray.elems {-ByCoordinates-}  ) $ Data.Array.IArray.elems {-ByRank-} byRank where 	terminateRow	= showChar '\n' 	showsRow	= Text.ShowList.showsDelimitedList columnDelimiter id terminateRow

@@ -48,10 +48,10 @@ } deriving Eq  instance (Show x, Show y) => Show (QualifiedMove x y) where-	showsPrec _ MkQualifiedMove {+	showsPrec precedence MkQualifiedMove { 		getMove		= move, 		getMoveType	= moveType-	} = shows (move, moveType)+	} = showsPrec precedence (move, moveType)  instance ( 	Enum	x,@@ -61,7 +61,7 @@ 	Read	x, 	Read	y  ) => Read (QualifiedMove x y) where-	readsPrec _	= map (Control.Arrow.first $ uncurry MkQualifiedMove) . reads+	readsPrec precedence	= map (Control.Arrow.first $ uncurry MkQualifiedMove) . readsPrec precedence  instance (Control.DeepSeq.NFData x, Control.DeepSeq.NFData y) => Control.DeepSeq.NFData (QualifiedMove x y) where 	rnf MkQualifiedMove {

@@ -81,11 +81,11 @@ 	} = Control.DeepSeq.rnf (qualifiedMove, rank, isRepeatableMove)  instance (Show x, Show y) => Show (Turn x y) where-	showsPrec _ MkTurn {+	showsPrec precedence MkTurn { 		getQualifiedMove	= qualifiedMove, 		getRank			= rank --		getIsRepeatableMove	= isRepeatableMove-	} = shows (+	} = showsPrec precedence ( 		qualifiedMove, 		rank --		isRepeatableMove	-- Derived.@@ -99,7 +99,7 @@ 	Read	x, 	Read	y  ) => Read (Turn x y) where-	readsPrec _	= map (Control.Arrow.first $ uncurry mkTurn) . reads+	readsPrec precedence	= map (Control.Arrow.first $ uncurry mkTurn) . readsPrec precedence  instance Enum y => Property.Reflectable.ReflectableOnX (Turn x y) where 	reflectOnX turn@MkTurn { getQualifiedMove = qualifiedMove } = turn { getQualifiedMove = Property.Reflectable.reflectOnX qualifiedMove }@@ -138,8 +138,7 @@  -- | Forwards the request to 'Attribute.Rank.compareByLVA'. compareByLVA-	:: Ord rankValue-	=> Attribute.Rank.EvaluateRank rankValue+	:: Attribute.Rank.EvaluateRank 	-> Turn x y 	-> Turn x y 	-> Ordering@@ -155,8 +154,7 @@ 	* CAVEAT: no account is made for any defenders of the attacked piece, which might recoup transient gains. -} compareByMVVLVA-	:: Ord rankValue-	=> Attribute.Rank.EvaluateRank rankValue+	:: Attribute.Rank.EvaluateRank 	-> Turn x y 	-> Turn x y 	-> Ordering

@@ -75,17 +75,17 @@  import			Control.Arrow((&&&), (***)) import qualified	BishBosh.Attribute.LogicalColour		as Attribute.LogicalColour-import qualified	BishBosh.Component.Move				as Component.Move import qualified	BishBosh.ContextualNotation.PGNComment		as ContextualNotation.PGNComment import qualified	BishBosh.ContextualNotation.StandardAlgebraic	as ContextualNotation.StandardAlgebraic import qualified	BishBosh.Data.Exception				as Data.Exception import qualified	BishBosh.Model.Game				as Model.Game-import qualified	BishBosh.Model.GameTerminationReason		as Model.GameTerminationReason-import qualified	BishBosh.Model.Result				as Model.Result import qualified	BishBosh.Property.FixedMembership		as Property.FixedMembership+import qualified	BishBosh.Rule.GameTerminationReason		as Rule.GameTerminationReason+import qualified	BishBosh.Rule.Result				as Rule.Result import qualified	BishBosh.State.TurnsByLogicalColour		as State.TurnsByLogicalColour import qualified	BishBosh.Text.ShowList				as Text.ShowList-import qualified	BishBosh.Types					as T+import qualified	BishBosh.Type.Count				as Type.Count+import qualified	BishBosh.Type.Length				as Type.Length import qualified	Control.Applicative import qualified	Control.Arrow import qualified	Control.DeepSeq@@ -215,7 +215,7 @@ 	Show	x, 	Show	y  ) => Show (PGN x y) where-	{-# SPECIALISE instance Show (PGN T.X T.Y) #-}+	{-# SPECIALISE instance Show (PGN Type.Length.X Type.Length.Y) #-} 	showsPrec _ MkPGN { 		getMaybeEventName		= maybeEventName, 		getMaybeSiteName		= maybeSiteName,@@ -243,7 +243,7 @@ 		), ( 			blackPlayerNameTag,	representUnknownTagValue maybeBlackPlayerName 		), (-			resultTag,		quote . Data.Maybe.maybe (showChar inProgressFlag) (shows . Model.GameTerminationReason.toResult) $ Model.Game.getMaybeTerminationReason game+			resultTag,		quote . Data.Maybe.maybe (showChar inProgressFlag) (shows . Rule.GameTerminationReason.toResult) $ Model.Game.getMaybeTerminationReason game 		) 	 ] ++ map ( 		Control.Arrow.second $ quote . showString@@ -308,7 +308,7 @@ setGame :: Model.Game.Game x y -> PGN x y -> PGN x y setGame game pgn	= pgn { getGame = game } --- | Smart-constructor.+-- | Smart constructor. mkPGN' 	:: [Tag]	-- ^ Identify fields used to form a unique composite game-identifier. 	-> [TagPair]	-- ^ The data from which to extract the required values.@@ -372,7 +372,7 @@ 	Show	x, 	Show	y  ) => Model.Game.Game x y -> ShowS-{-# SPECIALISE showsMoveText :: Model.Game.Game T.X T.Y -> ShowS #-}+{-# SPECIALISE showsMoveText :: Model.Game.Game Type.Length.X Type.Length.Y -> ShowS #-} showsMoveText game	= foldr (.) ( 	Data.Maybe.maybe ( 		showsBlockComment "Game unfinished" . showChar ' ' . showChar inProgressFlag@@ -380,7 +380,7 @@ 		( 			\(s, showsPGN) -> showsBlockComment s . showChar ' ' . showsPGN 		) . (-			filter (/= ContextualNotation.PGNComment.blockCommentEnd) . show &&& shows . Model.GameTerminationReason.toResult+			filter (/= ContextualNotation.PGNComment.blockCommentEnd) . show &&& shows . Rule.GameTerminationReason.toResult 		) 	) $ Model.Game.getMaybeTerminationReason game  ) $ Data.List.unfoldr (@@ -396,7 +396,7 @@ 		 ) $ Data.List.splitAt 1 remainder 		_				-> Nothing  ) (-	1	:: Component.Move.NMoves,+	1	:: Type.Count.NMoves, 	reverse {-chronological-} $ fst . foldr ( 		\turn (l, game')	-> ( 			ContextualNotation.StandardAlgebraic.showsTurn False turn game' : l,@@ -416,7 +416,7 @@ 	Show	x, 	Show	y  ) => Model.Game.Game x y -> IO ShowS-{-# SPECIALISE showsGame :: Model.Game.Game T.X T.Y -> IO ShowS #-}+{-# SPECIALISE showsGame :: Model.Game.Game Type.Length.X Type.Length.Y -> IO ShowS #-} showsGame game	= do 	utcTime	<- Data.Time.Clock.getCurrentTime @@ -453,12 +453,12 @@  	* N.B.: officially terminated by a single period (for White), or three (by Black); though this parser is more flexible. -}-moveNumberParser :: Num n =>+moveNumberParser :: #ifdef USE_POLYPARSE-	Text.Poly.TextParser n+	Text.Poly.TextParser Type.Count.NMoves moveNumberParser	= Control.Applicative.many ContextualNotation.PGNComment.blockCommentParser >> Text.Poly.unsignedDecimal `Poly.discard` Control.Applicative.some (Text.Poly.char moveNumberTerminator) #else /* Parsec */-	Parsec.Parser n+	Parsec.Parser Type.Count.NMoves moveNumberParser	= Parsec.try $ Control.Applicative.many ContextualNotation.PGNComment.blockCommentParser >> Parsec.spaces >> fmap Data.Integral.stringToUnsignedDecimal ( 	Parsec.manyTill Parsec.digit ( 		Control.Applicative.some $ Parsec.char moveNumberTerminator@@ -469,7 +469,7 @@ -- | Parse an optional result. maybeResultParser :: #ifdef USE_POLYPARSE-	Text.Poly.TextParser (Maybe Model.Result.Result)+	Text.Poly.TextParser (Maybe Rule.Result.Result) maybeResultParser	= Control.Applicative.many ContextualNotation.PGNComment.blockCommentParser >> Text.Poly.spaces >> Poly.oneOf' [ 	( 		"Result",@@ -482,7 +482,7 @@ 	)  ] #else /* Parsec */-	Parsec.Parser (Maybe Model.Result.Result)+	Parsec.Parser (Maybe Rule.Result.Result) maybeResultParser	= Control.Applicative.many ContextualNotation.PGNComment.blockCommentParser >> Parsec.spaces >> ( 	Parsec.try ( 		Parsec.choice $ map (@@ -507,7 +507,7 @@ 	=> IsStrictlySequential 	-> ContextualNotation.StandardAlgebraic.ValidateMoves 	-> Text.Poly.TextParser (Model.Game.Game x y)-{-# SPECIALISE moveTextParser :: IsStrictlySequential -> ContextualNotation.StandardAlgebraic.ValidateMoves -> Text.Poly.TextParser (Model.Game.Game T.X T.Y) #-}+{-# SPECIALISE moveTextParser :: IsStrictlySequential -> ContextualNotation.StandardAlgebraic.ValidateMoves -> Text.Poly.TextParser (Model.Game.Game Type.Length.X Type.Length.Y) #-} moveTextParser isStrictlySequential validateMoves	= let 	elementSequenceParser :: ( 		Enum	x,@@ -518,7 +518,8 @@ 		Show	y 	 ) => Model.Game.Game x y -> Text.Poly.TextParser (Model.Game.Game x y) 	elementSequenceParser game	= let-		expectedMoveNumber	= succ . (`div` 2) . State.TurnsByLogicalColour.getNPlies $ Model.Game.getTurnsByLogicalColour game+		expectedMoveNumber :: Type.Count.NMoves+		expectedMoveNumber	= fromIntegral . succ . (`div` 2) . State.TurnsByLogicalColour.getNPlies $ Model.Game.getTurnsByLogicalColour game 	 in do 		moveNumber	<- ( 			if Attribute.LogicalColour.isBlack $ Model.Game.getNextLogicalColour game@@ -553,7 +554,7 @@ 	=> IsStrictlySequential 	-> ContextualNotation.StandardAlgebraic.ValidateMoves 	-> Parsec.Parser (Model.Game.Game x y)-{-# SPECIALISE moveTextParser :: IsStrictlySequential -> ContextualNotation.StandardAlgebraic.ValidateMoves -> Parsec.Parser (Model.Game.Game T.X T.Y) #-}+{-# SPECIALISE moveTextParser :: IsStrictlySequential -> ContextualNotation.StandardAlgebraic.ValidateMoves -> Parsec.Parser (Model.Game.Game Type.Length.X Type.Length.Y) #-} moveTextParser isStrictlySequential validateMoves	= let 	elementSequenceParser :: ( 		Enum	x,@@ -564,7 +565,8 @@ 		Show	y 	 ) => Model.Game.Game x y -> Parsec.Parser (Model.Game.Game x y) 	elementSequenceParser game	= let-		expectedMoveNumber	= succ . (`div` 2) . State.TurnsByLogicalColour.getNPlies $ Model.Game.getTurnsByLogicalColour game+		expectedMoveNumber :: Type.Count.NMoves+		expectedMoveNumber	= fromIntegral . succ . (`div` 2) . State.TurnsByLogicalColour.getNPlies $ Model.Game.getTurnsByLogicalColour game 	 in do 		moveNumber	<- ( 			if Attribute.LogicalColour.isBlack $ Model.Game.getNextLogicalColour game@@ -614,7 +616,7 @@ 	-> [Tag]	-- ^ Identify fields used to form a unique composite game-identifier. #ifdef USE_POLYPARSE 	-> Text.Poly.TextParser (PGN x y)-{-# SPECIALISE parser :: IsStrictlySequential -> ContextualNotation.StandardAlgebraic.ValidateMoves -> [Tag] -> Text.Poly.TextParser (PGN T.X T.Y) #-}+{-# SPECIALISE parser :: IsStrictlySequential -> ContextualNotation.StandardAlgebraic.ValidateMoves -> [Tag] -> Text.Poly.TextParser (PGN Type.Length.X Type.Length.Y) #-} parser isStrictlySequential validateMoves identificationTags	= do 	tagPairs	<- Control.Applicative.many $ tagPairParser <* Control.Applicative.many ContextualNotation.PGNComment.parser 	moveText	<- moveTextParser' <* Control.Applicative.many ContextualNotation.PGNComment.parser@@ -642,7 +644,7 @@ 		 ) #else /* Parsec */ 	-> Parsec.Parser (PGN x y)-{-# SPECIALISE parser :: IsStrictlySequential -> ContextualNotation.StandardAlgebraic.ValidateMoves -> [Tag] -> Parsec.Parser (PGN T.X T.Y) #-}+{-# SPECIALISE parser :: IsStrictlySequential -> ContextualNotation.StandardAlgebraic.ValidateMoves -> [Tag] -> Parsec.Parser (PGN Type.Length.X Type.Length.Y) #-} parser isStrictlySequential validateMoves identificationTags	= mkPGN' identificationTags <$> ( 	removeUnknownTagValues <$> Control.Applicative.many ( 		tagPairParser <* Control.Applicative.many ContextualNotation.PGNComment.parser

@@ -35,7 +35,7 @@ 	PGNDatabase, --	PGNPredicate, 	Decompressor,---	MaybeMaximumGames,+	MaybeMaximumGames, -- * Functions --	parser, --	parse,@@ -46,7 +46,8 @@ import qualified	BishBosh.ContextualNotation.PGN			as ContextualNotation.PGN import qualified	BishBosh.ContextualNotation.StandardAlgebraic	as ContextualNotation.StandardAlgebraic import qualified	BishBosh.Data.Exception				as Data.Exception-import qualified	BishBosh.Types					as T+import qualified	BishBosh.Type.Count				as Type.Count+import qualified	BishBosh.Type.Length				as Type.Length import qualified	Control.Exception import qualified	Control.Monad import qualified	Data.Maybe@@ -57,12 +58,14 @@  #ifdef USE_POLYPARSE import qualified	BishBosh.Text.Poly				as Text.Poly-#if USE_POLYPARSE == 1+#	if USE_POLYPARSE == 1 import qualified	Text.ParserCombinators.Poly.Lazy		as Poly-#else /* Plain */+#	else /* Plain */+import qualified	Control.Arrow import qualified	Text.ParserCombinators.Poly.Plain		as Poly-#endif+#	endif #else /* Parsec */+import qualified	Control.Arrow import qualified	Text.ParserCombinators.Parsec			as Parsec import			Text.ParserCombinators.Parsec((<?>)) #endif@@ -84,11 +87,11 @@ 	-> [ContextualNotation.PGN.Tag] #ifdef USE_POLYPARSE 	-> Text.Poly.TextParser (PGNDatabase x y)-{-# SPECIALISE parser :: ContextualNotation.PGN.IsStrictlySequential -> ContextualNotation.StandardAlgebraic.ValidateMoves -> [ContextualNotation.PGN.Tag] -> Text.Poly.TextParser (PGNDatabase T.X T.Y) #-}+{-# SPECIALISE parser :: ContextualNotation.PGN.IsStrictlySequential -> ContextualNotation.StandardAlgebraic.ValidateMoves -> [ContextualNotation.PGN.Tag] -> Text.Poly.TextParser (PGNDatabase Type.Length.X Type.Length.Y) #-} parser isStrictlySequential validateMoves identificationTags	= Poly.manyFinally' parser' $ Text.Poly.spaces >> Poly.eof #else /* Parsec */ 	-> Parsec.Parser (PGNDatabase x y)-{-# SPECIALISE parser :: ContextualNotation.PGN.IsStrictlySequential -> ContextualNotation.StandardAlgebraic.ValidateMoves -> [ContextualNotation.PGN.Tag] -> Parsec.Parser (PGNDatabase T.X T.Y) #-}+{-# SPECIALISE parser :: ContextualNotation.PGN.IsStrictlySequential -> ContextualNotation.StandardAlgebraic.ValidateMoves -> [ContextualNotation.PGN.Tag] -> Parsec.Parser (PGNDatabase Type.Length.X Type.Length.Y) #-} parser isStrictlySequential validateMoves identificationTags	= Parsec.manyTill parser' (Parsec.try $ Parsec.spaces >> Parsec.try Parsec.eof)	<?> "PGN-database" #endif 	where@@ -98,7 +101,7 @@ type PGNPredicate x y	= ContextualNotation.PGN.PGN x y -> Bool  -- | The optional maximum number of games to read.-type MaybeMaximumGames	= Maybe Int+type MaybeMaximumGames	= Maybe Type.Count.NGames  -- | Parses a PGN-database from the specified string. parse :: (@@ -117,20 +120,20 @@ 	-> MaybeMaximumGames	-- ^ Optional maximum number of games to read from the database (after they've been filtered). 	-> String		-- ^ The database-contents. 	-> Either String (PGNDatabase x y)-{-# SPECIALISE parse :: String -> ContextualNotation.PGN.IsStrictlySequential -> ContextualNotation.StandardAlgebraic.ValidateMoves -> [ContextualNotation.PGN.Tag] -> PGNPredicate T.X T.Y -> MaybeMaximumGames -> String -> Either String (PGNDatabase T.X T.Y) #-}+{-# SPECIALISE parse :: String -> ContextualNotation.PGN.IsStrictlySequential -> ContextualNotation.StandardAlgebraic.ValidateMoves -> [ContextualNotation.PGN.Tag] -> PGNPredicate Type.Length.X Type.Length.Y -> MaybeMaximumGames -> String -> Either String (PGNDatabase Type.Length.X Type.Length.Y) #-} #ifdef USE_POLYPARSE-#if USE_POLYPARSE == 1+#	if USE_POLYPARSE == 1 parse _ isStrictlySequential validateMoves identificationTags pgnPredicate maybeMaximumGames	= Right	-- N.B.: the lazy parser throws an exception rather than returning 'Either', because otherwise it can't choose whether to construct with 'Left' or 'Right' until the input has been fully parsed.-#else /* Plain */-parse name isStrictlySequential validateMoves identificationTags pgnPredicate maybeMaximumGames	= either (Left . showString "regarding " . shows name . showString ", ") Right-#endif+#	else /* Plain */+parse name isStrictlySequential validateMoves identificationTags pgnPredicate maybeMaximumGames	= Control.Arrow.left (showString "regarding " . shows name . showString ", ")+#	endif 	. fst {-discard unparsed data-} . Poly.runParser parser' #else /* Parsec */-parse name isStrictlySequential validateMoves identificationTags pgnPredicate maybeMaximumGames	= either (Left . showString "failed to parse; " . show) Right . Parsec.parse parser' name+parse name isStrictlySequential validateMoves identificationTags pgnPredicate maybeMaximumGames	= Control.Arrow.left (showString "failed to parse; " . show) . Parsec.parse parser' name #endif 	where 		parser'	= (-			Data.Maybe.maybe id take maybeMaximumGames . filter pgnPredicate	-- CAVEAT: apply the filter before extracting the required number of games.+			Data.Maybe.maybe id (take . fromIntegral) maybeMaximumGames . filter pgnPredicate	-- CAVEAT: apply the filter before extracting the required number of games. 		 ) `fmap` parser isStrictlySequential validateMoves identificationTags  -- | The name of an executable used to decompress (to stdout) the PGN-file.@@ -154,7 +157,7 @@ 	-> PGNPredicate x y		-- ^ Used to filter entries from the database. 	-> MaybeMaximumGames		-- ^ Optional maximum number of games to read from the database (after they've been filtered). 	-> IO (Either String (PGNDatabase x y))-{-# SPECIALISE parseIO :: System.FilePath.FilePath -> Maybe Decompressor -> ContextualNotation.PGN.IsStrictlySequential -> ContextualNotation.StandardAlgebraic.ValidateMoves -> System.IO.TextEncoding -> [ContextualNotation.PGN.Tag] -> PGNPredicate T.X T.Y -> MaybeMaximumGames -> IO (Either String (PGNDatabase T.X T.Y)) #-}+{-# SPECIALISE parseIO :: System.FilePath.FilePath -> Maybe Decompressor -> ContextualNotation.PGN.IsStrictlySequential -> ContextualNotation.StandardAlgebraic.ValidateMoves -> System.IO.TextEncoding -> [ContextualNotation.PGN.Tag] -> PGNPredicate Type.Length.X Type.Length.Y -> MaybeMaximumGames -> IO (Either String (PGNDatabase Type.Length.X Type.Length.Y)) #-} parseIO filePath maybeDecompressionCommand isStrictlySequential validateMoves textEncoding identificationTags pgnPredicate maybeMaximumGames	= parse filePath isStrictlySequential validateMoves identificationTags pgnPredicate maybeMaximumGames `fmap` Data.Maybe.maybe ( 	System.IO.withFile filePath System.IO.ReadMode $ \fileHandle -> do 		System.IO.hSetEncoding fileHandle textEncoding

@@ -54,10 +54,12 @@ import qualified	BishBosh.Component.Zobrist			as Component.Zobrist import qualified	BishBosh.ContextualNotation.QualifiedMoveForest	as ContextualNotation.QualifiedMoveForest import qualified	BishBosh.Model.Game				as Model.Game-import qualified	BishBosh.Model.Result				as Model.Result import qualified	BishBosh.Property.Reflectable			as Property.Reflectable+import qualified	BishBosh.Rule.Result				as Rule.Result import qualified	BishBosh.State.Board				as State.Board-import qualified	BishBosh.Types					as T+import qualified	BishBosh.Type.Count				as Type.Count+import qualified	BishBosh.Type.Crypto				as Type.Crypto+import qualified	BishBosh.Type.Length				as Type.Length import qualified	Control.Arrow import qualified	Control.Exception import qualified	Data.Array.IArray@@ -89,7 +91,7 @@ data PositionHashQualifiedMoveTree x y positionHash	= MkPositionHashQualifiedMoveTree { 	getZobrist		:: Component.Zobrist.Zobrist x y positionHash,	-- ^ Used to hash each position in the tree. 	getTree			:: Tree x y positionHash,-	getMinimumPieces	:: Component.Piece.NPieces			-- ^ The minimum number of /piece/s remaining after the last /move/ in any game defined in the tree.+	getMinimumPieces	:: Type.Count.NPieces				-- ^ The minimum number of /piece/s remaining after the last /move/ in any game defined in the tree. }  -- | Augment the specified /qualified-move forest/ with a /Zobrist-hash/ of the /position/ & include the default initial game at the apex.@@ -106,7 +108,7 @@ 	-> Component.Zobrist.Zobrist x y positionHash 	-> ContextualNotation.QualifiedMoveForest.QualifiedMoveForest x y 	-> PositionHashQualifiedMoveTree x y positionHash-{-# SPECIALISE fromQualifiedMoveForest :: Bool -> Component.Zobrist.Zobrist T.X T.Y T.PositionHash -> ContextualNotation.QualifiedMoveForest.QualifiedMoveForest T.X T.Y -> PositionHashQualifiedMoveTree T.X T.Y T.PositionHash #-}+{-# SPECIALISE fromQualifiedMoveForest :: Bool -> Component.Zobrist.Zobrist Type.Length.X Type.Length.Y Type.Crypto.PositionHash -> ContextualNotation.QualifiedMoveForest.QualifiedMoveForest Type.Length.X Type.Length.Y -> PositionHashQualifiedMoveTree Type.Length.X Type.Length.Y Type.Crypto.PositionHash #-} fromQualifiedMoveForest incrementalEvaluation zobrist qualifiedMoveForest	= MkPositionHashQualifiedMoveTree { 	getZobrist		= zobrist, 	getTree			= let@@ -199,7 +201,7 @@ 	Enum			y, 	Ord			y  ) => FindMatch x y positionHash-{-# SPECIALISE findNextOnymousQualifiedMovesForPosition :: FindMatch T.X T.Y T.PositionHash #-}+{-# SPECIALISE findNextOnymousQualifiedMovesForPosition :: FindMatch Type.Length.X Type.Length.Y Type.Crypto.PositionHash #-} findNextOnymousQualifiedMovesForPosition requiredGame positionHashQualifiedMoveTree@MkPositionHashQualifiedMoveTree { 	getZobrist	= zobrist, 	getTree		= tree@@ -207,26 +209,26 @@ 	| cantConverge requiredGame positionHashQualifiedMoveTree	= []	-- The specified game has fewer pieces than any defined in the tree. 	| otherwise							= slave (2 * Component.Piece.nPiecesPerSide) tree 	where+		(requiredPositionHash, requiredNPieces)	= (`Component.Zobrist.hash2D` zobrist) &&& State.Board.getNPieces . Model.Game.getBoard $ requiredGame+ 		slave nPieces Data.Tree.Node { 			Data.Tree.rootLabel	= MkNodeLabel { getPositionHash = positionHash }, 			Data.Tree.subForest	= forest-		}-			| nPieces < State.Board.getNPieces (-				Model.Game.getBoard requiredGame-			)		= []	-- There are fewer pieces remaining in the tree than required.-			| otherwise	= (-				if positionHash == Component.Zobrist.hash2D requiredGame zobrist-					then (-						map onymiseQualifiedMove forest ++	-- The Zobrist-hash/position matches, so one can select any move from the forest.-					) -- Section.-					else id-			) $ concatMap (-				\node@Data.Tree.Node {-					Data.Tree.rootLabel	= MkNodeLabel { getMaybeQualifiedMoveWithOnymousResult = Just (qualifiedMove, _) }-				} -> slave (-					Attribute.MoveType.nPiecesMutator (Component.QualifiedMove.getMoveType qualifiedMove) nPieces-				) node -- Recurse to see if deeper matches exist.-			) forest+		} = (+			if positionHash == requiredPositionHash+				then (+					map onymiseQualifiedMove forest ++	-- The position matches, so one can select any move from the forest.+				) -- Section.+				else id+		 ) $ concatMap (+			\node@Data.Tree.Node {+				Data.Tree.rootLabel	= MkNodeLabel { getMaybeQualifiedMoveWithOnymousResult = Just (qualifiedMove, _) }+			} -> if Attribute.MoveType.isCapture $ Component.QualifiedMove.getMoveType qualifiedMove+				then if nPieces == requiredNPieces+					then []	-- Terminate the recursion; no further pieces can be lost if a match is to occur.+					else slave (pred nPieces) node	-- Recurse.+				else slave nPieces node	-- Recurse.+		 ) forest  -- | Finds any single /move/s which can join the current /position/ with a member of the forest. findNextJoiningOnymousQualifiedMovesFromPosition :: (@@ -242,24 +244,21 @@ 	Show			x, 	Show			y  ) => FindMatch x y positionHash-{-# SPECIALISE findNextJoiningOnymousQualifiedMovesFromPosition :: FindMatch T.X T.Y T.PositionHash #-}-findNextJoiningOnymousQualifiedMovesFromPosition game positionHashQualifiedMoveTree	= [-	(-		preMatchQualifiedMove,-		concatMap snd {-[OnymousResult]-} matchingOnymousQualifiedMoves	-- Discard the opponent's matching move, but cite the names of archived games it reached.-	) |-		not $ Model.Game.isTerminated game,-		(preMatchQualifiedMove, matchingOnymousQualifiedMoves)	<-+{-# SPECIALISE findNextJoiningOnymousQualifiedMovesFromPosition :: FindMatch Type.Length.X Type.Length.Y Type.Crypto.PositionHash #-}+findNextJoiningOnymousQualifiedMovesFromPosition game positionHashQualifiedMoveTree+	| Model.Game.isTerminated game	= []+	| otherwise			= [+		Control.Arrow.second (concatMap snd {-[OnymousResult]-}) movePair |	-- Discard the opponent's matching move, but cite the names of archived games it reached.+			movePair@(_, _ : _)	<- #ifdef USE_PARALLEL-		Control.Parallel.Strategies.withStrategy (-			Control.Parallel.Strategies.parList $ Control.Parallel.Strategies.evalTuple2 Control.Parallel.Strategies.r0 {-pre-match move-} Control.Parallel.Strategies.rdeepseq {-matching moves-}-		) .+				Control.Parallel.Strategies.withStrategy (+					Control.Parallel.Strategies.parList $ Control.Parallel.Strategies.evalTuple2 Control.Parallel.Strategies.r0 {-pre-match move-} Control.Parallel.Strategies.rdeepseq {-matching moves-}+				) . #endif-		map (-			id &&& (`findNextOnymousQualifiedMovesForPosition` positionHashQualifiedMoveTree) . (`Model.Game.applyQualifiedMove` game)	-- Apply this player's move.-		) $ Model.Game.findQualifiedMovesAvailableToNextPlayer game,-		not $ null matchingOnymousQualifiedMoves- ] -- List-comprehension.+				map (+					id &&& (`findNextOnymousQualifiedMovesForPosition` positionHashQualifiedMoveTree) . (`Model.Game.applyQualifiedMove` game)	-- Apply this player's move.+				) $ Model.Game.findQualifiedMovesAvailableToNextPlayer game+	] -- List-comprehension.  {- | 	* Calls 'findNextOnymousQualifiedMovesForGame' to find an exact match for the current /game/ in the tree.@@ -289,7 +288,7 @@  ) 	=> (Bool, Bool, Bool)	-- ^ MatchSwitches. 	-> FindMatch x y positionHash-{-# SPECIALISE findNextOnymousQualifiedMoves :: (Bool, Bool, Bool) -> FindMatch T.X T.Y T.PositionHash #-}+{-# SPECIALISE findNextOnymousQualifiedMoves :: (Bool, Bool, Bool) -> FindMatch Type.Length.X Type.Length.Y Type.Crypto.PositionHash #-} findNextOnymousQualifiedMoves (tryToMatchMoves, tryToMatchViaJoiningMove, tryToMatchColourFlippedPosition) game positionHashQualifiedMoveTree 	| cantConverge game positionHashQualifiedMoveTree	= []	-- The specified game is smaller than any defined in the tree. 	| otherwise						= Data.Maybe.fromMaybe [] . Data.List.find (@@ -336,9 +335,9 @@ 	:: System.Random.RandomGen randomGen 	=> randomGen 	-> (Bool, Bool, Bool)-	-> Model.Game.Game T.X T.Y-	-> PositionHashQualifiedMoveTree T.X T.Y T.PositionHash-	-> Maybe (Component.QualifiedMove.QualifiedMove T.X T.Y, [ContextualNotation.QualifiedMoveForest.Name])+	-> Model.Game.Game Type.Length.X Type.Length.Y+	-> PositionHashQualifiedMoveTree Type.Length.X Type.Length.Y Type.Crypto.PositionHash+	-> Maybe (Component.QualifiedMove.QualifiedMove Type.Length.X Type.Length.Y, [ContextualNotation.QualifiedMoveForest.Name])  #-} maybeRandomlySelectOnymousQualifiedMove randomGen matchSwitches game positionHashQualifiedMoveTree	= case findNextOnymousQualifiedMoves matchSwitches game positionHashQualifiedMoveTree of 	[]			-> Nothing@@ -354,7 +353,7 @@ 						then id 						else negate 				) 1 {-victory-}-			) . Model.Result.findMaybeVictor . snd {-result-}	-- Score the result, according to which side we'd like to win.+			) . Rule.Result.findMaybeVictor . snd {-result-}	-- Score the result, according to which side we'd like to win. 		) . snd {-[OnymousResult]-} 	 ) onymousQualifiedMoves 

@@ -50,24 +50,23 @@  import			Control.Applicative((<|>)) import			Control.Arrow((&&&), (***))-import qualified	BishBosh.Attribute.MoveType			as Attribute.MoveType-import qualified	BishBosh.Component.Move				as Component.Move-import qualified	BishBosh.Component.Piece			as Component.Piece-import qualified	BishBosh.Component.QualifiedMove		as Component.QualifiedMove-import qualified	BishBosh.Component.Turn				as Component.Turn-import qualified	BishBosh.ContextualNotation.PGN			as ContextualNotation.PGN-import qualified	BishBosh.ContextualNotation.PGNDatabase		as ContextualNotation.PGNDatabase-import qualified	BishBosh.Data.RoseTree				as Data.RoseTree-import qualified	BishBosh.Model.Game				as Model.Game-import qualified	BishBosh.Model.GameTerminationReason		as Model.GameTerminationReason-import qualified	BishBosh.Model.GameTree				as Model.GameTree-import qualified	BishBosh.Model.Result				as Model.Result-import qualified	BishBosh.Notation.MoveNotation			as Notation.MoveNotation-import qualified	BishBosh.Property.Empty				as Property.Empty-import qualified	BishBosh.Property.Null				as Property.Null-import qualified	BishBosh.State.Board				as State.Board-import qualified	BishBosh.Text.ShowList				as Text.ShowList-import qualified	BishBosh.Types					as T+import qualified	BishBosh.Attribute.MoveType		as Attribute.MoveType+import qualified	BishBosh.Component.QualifiedMove	as Component.QualifiedMove+import qualified	BishBosh.Component.Turn			as Component.Turn+import qualified	BishBosh.ContextualNotation.PGN		as ContextualNotation.PGN+import qualified	BishBosh.ContextualNotation.PGNDatabase	as ContextualNotation.PGNDatabase+import qualified	BishBosh.Data.RoseTree			as Data.RoseTree+import qualified	BishBosh.Model.Game			as Model.Game+import qualified	BishBosh.Model.GameTree			as Model.GameTree+import qualified	BishBosh.Notation.MoveNotation		as Notation.MoveNotation+import qualified	BishBosh.Property.Empty			as Property.Empty+import qualified	BishBosh.Property.Null			as Property.Null+import qualified	BishBosh.Rule.GameTerminationReason	as Rule.GameTerminationReason+import qualified	BishBosh.Rule.Result			as Rule.Result+import qualified	BishBosh.State.Board			as State.Board+import qualified	BishBosh.Text.ShowList			as Text.ShowList+import qualified	BishBosh.Type.Count			as Type.Count+import qualified	BishBosh.Type.Length			as Type.Length import qualified	Control.Arrow import qualified	Data.Default import qualified	Data.List@@ -78,7 +77,7 @@ type Name	= String  -- | The name of a /game/, & it's /result/.-type OnymousResult	= (Name, Model.Result.Result)+type OnymousResult	= (Name, Rule.Result.Result)  {- | 	* Terminal nodes contain the unique name of the /move/-sequence leading to them, from which other information can be found as required, from the original database.@@ -119,19 +118,19 @@ 		) maybeOnymousResult "" 	 ) forest --- | Shows a list of the names of archived games, optionally capped at the specified number.+-- | Shows an optional capped list of the names of archived games. showsNames-	:: Maybe Int	-- ^ The optional maximum number of names to show.+	:: Maybe Type.Count.NGames	-- ^ The optional maximum number of names to show. 	-> [Name] 	-> ShowS showsNames maybeMaximumPGNNames names	= Text.ShowList.showsUnterminatedList . map ( 	\name -> showString "\n\t" . showString name  ) $ Data.Maybe.maybe id ( 	\maximumPGNNames -> (-		if maximumPGNNames < length names'+		if fromIntegral maximumPGNNames < length names' 			then (++ ["..."]) 			else id-	) . take maximumPGNNames+	) . take (fromIntegral maximumPGNNames)  ) maybeMaximumPGNNames names' where 	names'	= Data.List.nub $ Data.List.sort names @@ -144,8 +143,8 @@ mergePGNDatabase pgnDatabase MkQualifiedMoveForest { deconstruct = initialForest }	= MkQualifiedMoveForest $ foldr ( 	\pgn -> merge ( 		mkCompositeIdentifier &&& Data.Maybe.maybe (-			Model.Result.mkResult Nothing	-- The game is still in progress.-		) Model.GameTerminationReason.toResult . Model.Game.getMaybeTerminationReason . ContextualNotation.PGN.getGame $ pgn	-- Construct an onymous result.+			Rule.Result.mkResult Nothing	-- The game is still in progress.+		) Rule.GameTerminationReason.toResult . Model.Game.getMaybeTerminationReason . ContextualNotation.PGN.getGame $ pgn	-- Construct an onymous result. 	) ( 		map Component.Turn.getQualifiedMove . Model.Game.listTurnsChronologically $ ContextualNotation.PGN.getGame pgn	-- Extract the list of qualified moves defining this game. 	)@@ -192,10 +191,10 @@ fromPGNDatabase	= (`mergePGNDatabase` Property.Empty.empty {-QualifiedMoveForest-})  -- | Find the minimum number of /piece/s in any of the recorded /game/s.-findMinimumPieces :: QualifiedMoveForest x y -> Component.Piece.NPieces+findMinimumPieces :: QualifiedMoveForest x y -> Type.Count.NPieces findMinimumPieces	= slave ( 	State.Board.getNPieces (-		Data.Default.def	:: State.Board.Board T.X T.Y	-- CAVEAT: this assumes the game to which the moves in the forest refer.+		Data.Default.def	:: State.Board.Board Type.Length.X Type.Length.Y	-- CAVEAT: this assumes the game to which the moves in the forest refer. 	)  ) . deconstruct where 	slave nPieces []	= nPieces@@ -208,22 +207,22 @@ 		) subForest	-- Recurse. 	 ) forest --- | Count the number of /game/s & /plies/.-count :: QualifiedMoveForest x y -> (Model.Game.NGames, Component.Move.NPlies)+-- | Count the number of /game/s & distinct /positions/.+count :: QualifiedMoveForest x y -> (Type.Count.NGames, Type.Count.NPositions) count	= slave . deconstruct where 	slave	= Data.List.foldl' (-		\(nGames, nPlies) Data.Tree.Node {+		\(nGames, nPositions) Data.Tree.Node { 			Data.Tree.rootLabel	= (_, maybeOnymousResult), 			Data.Tree.subForest	= forest 		} -> let-			acc@(nGames', nPlies')	= (+			acc@(nGames', nPositions')	= ( 				(+ nGames) . ( 					if Data.Maybe.isJust maybeOnymousResult 						then succ 						else id-				) *** (+ nPlies) . succ+				) *** (+ nPositions) . succ 			 ) $ slave forest {-recurse-}-		in nGames' `seq` nPlies' `seq` acc+		in nGames' `seq` nPositions' `seq` acc 	 ) (0, 0)  {- |@@ -239,7 +238,7 @@ 	Show	x, 	Show	y  ) => QualifiedMoveForest x y -> Model.GameTree.GameTree x y-{-# SPECIALISE toGameTree :: QualifiedMoveForest T.X T.Y -> Model.GameTree.GameTree T.X T.Y #-}+{-# SPECIALISE toGameTree :: QualifiedMoveForest Type.Length.X Type.Length.Y -> Model.GameTree.GameTree Type.Length.X Type.Length.Y #-} toGameTree MkQualifiedMoveForest { deconstruct = qualifiedMoveForest }	= Model.GameTree.fromBareGameTree Data.Tree.Node { 	Data.Tree.rootLabel	= initialGame, 	Data.Tree.subForest	= map (slave initialGame) qualifiedMoveForest@@ -254,3 +253,4 @@ 		Data.Tree.subForest	= map (slave game') qualifiedMoveForest'	-- Recurse. 	} where 		game'	= Model.Game.applyQualifiedMove qualifiedMove game+

@@ -69,13 +69,13 @@ import qualified	BishBosh.Component.Turn			as Component.Turn import qualified	BishBosh.Data.Exception			as Data.Exception import qualified	BishBosh.Model.Game			as Model.Game-import qualified	BishBosh.Model.GameTerminationReason	as Model.GameTerminationReason import qualified	BishBosh.Notation.PureCoordinate	as Notation.PureCoordinate import qualified	BishBosh.Property.ForsythEdwards	as Property.ForsythEdwards+import qualified	BishBosh.Rule.GameTerminationReason	as Rule.GameTerminationReason import qualified	BishBosh.State.Board			as State.Board import qualified	BishBosh.State.MaybePieceByCoordinates	as State.MaybePieceByCoordinates import qualified	BishBosh.Text.ShowList			as Text.ShowList-import qualified	BishBosh.Types				as T+import qualified	BishBosh.Type.Length			as Type.Length import qualified	Control.Applicative import qualified	Control.Exception import qualified	Control.Monad@@ -161,7 +161,7 @@ 	-> Component.Turn.Turn x y 	-> Model.Game.Game x y	-- ^ The /game/ prior to application of the specified /turn/. 	-> ShowS-{-# SPECIALISE showsTurn :: ExplicitEnPassant -> Component.Turn.Turn T.X T.Y -> Model.Game.Game T.X T.Y -> ShowS #-}+{-# SPECIALISE showsTurn :: ExplicitEnPassant -> Component.Turn.Turn Type.Length.X Type.Length.Y -> Model.Game.Game Type.Length.X Type.Length.Y -> ShowS #-} showsTurn explicitEnPassant turn game 	| Just sourceRank <- fmap Component.Piece.getRank . State.MaybePieceByCoordinates.dereference source $ State.Board.getMaybePieceByCoordinates board	= ( 		if sourceRank == Attribute.Rank.Pawn@@ -200,7 +200,7 @@ 				 ) . showsDestination 	) . ( 		if Data.Maybe.isJust $ Model.Game.getMaybeChecked game'-			then showChar $ if Data.Maybe.maybe False Model.GameTerminationReason.isCheckMate $ Model.Game.getMaybeTerminationReason game'+			then showChar $ if Data.Maybe.maybe False Rule.GameTerminationReason.isCheckMate $ Model.Game.getMaybeTerminationReason game' 				then checkMateFlag 				else checkFlag 			else id@@ -237,7 +237,7 @@ 	-> Component.Turn.Turn x y 	-> Model.Game.Game x y	-- ^ The /game/ prior to application of the specified /turn/. 	-> String-{-# SPECIALISE showTurn :: ExplicitEnPassant -> Component.Turn.Turn T.X T.Y -> Model.Game.Game T.X T.Y -> String #-}+{-# SPECIALISE showTurn :: ExplicitEnPassant -> Component.Turn.Turn Type.Length.X Type.Length.Y -> Model.Game.Game Type.Length.X Type.Length.Y -> String #-} showTurn explicitEnPassant turn game	= showsTurn explicitEnPassant turn game ""  -- | A convenience-function, which generates the /turn/ required to call 'showsTurn'.@@ -253,7 +253,7 @@ 	-> Component.QualifiedMove.QualifiedMove x y 	-> Model.Game.Game x y 	-> ShowS-{-# SPECIALISE showsMove :: ExplicitEnPassant -> Component.QualifiedMove.QualifiedMove T.X T.Y -> Model.Game.Game T.X T.Y -> ShowS #-}+{-# SPECIALISE showsMove :: ExplicitEnPassant -> Component.QualifiedMove.QualifiedMove Type.Length.X Type.Length.Y -> Model.Game.Game Type.Length.X Type.Length.Y -> ShowS #-} showsMove explicitEnPassant qualifiedMove game	= showsTurn explicitEnPassant ( 	Data.Maybe.fromMaybe ( 		Control.Exception.throw $ Data.Exception.mkResultUndefined "BishBosh.ContextualNotation.StandardAlgebraic.showsMove:\tModel.Game.maybeLastTurn failed."@@ -273,7 +273,7 @@ 	-> Component.QualifiedMove.QualifiedMove x y 	-> Model.Game.Game x y 	-> String-{-# SPECIALISE showMove :: ExplicitEnPassant -> Component.QualifiedMove.QualifiedMove T.X T.Y -> Model.Game.Game T.X T.Y -> String #-}+{-# SPECIALISE showMove :: ExplicitEnPassant -> Component.QualifiedMove.QualifiedMove Type.Length.X Type.Length.Y -> Model.Game.Game Type.Length.X Type.Length.Y -> String #-} showMove explicitEnPassant qualifiedMove game	= showsMove explicitEnPassant qualifiedMove game ""  -- | Applies the specified /move/ to the specified /game/.@@ -285,7 +285,7 @@ 	Show	x, 	Show	y  ) => StandardAlgebraic x y -> Model.Game.Transformation x y-{-# SPECIALISE movePiece :: StandardAlgebraic T.X T.Y -> Model.Game.Transformation T.X T.Y #-}+{-# SPECIALISE movePiece :: StandardAlgebraic Type.Length.X Type.Length.Y -> Model.Game.Transformation Type.Length.X Type.Length.Y #-} movePiece MkStandardAlgebraic { getQualifiedMove = qualifiedMove }	= Model.Game.applyQualifiedMove qualifiedMove  #ifdef USE_POLYPARSE@@ -332,7 +332,7 @@ 	-> Model.Game.Game x y #ifdef USE_POLYPARSE 	-> Text.Poly.TextParser (StandardAlgebraic x y)-{-# SPECIALISE parser :: ExplicitEnPassant -> ValidateMoves -> Model.Game.Game T.X T.Y -> Text.Poly.TextParser (StandardAlgebraic T.X T.Y) #-}+{-# SPECIALISE parser :: ExplicitEnPassant -> ValidateMoves -> Model.Game.Game Type.Length.X Type.Length.Y -> Text.Poly.TextParser (StandardAlgebraic Type.Length.X Type.Length.Y) #-} parser explicitEnPassant validateMoves game	= let 	nextLogicalColour			= Model.Game.getNextLogicalColour game 	(longCastlingMove, shortCastlingMove)	= Component.CastlingMove.getLongAndShortMoves nextLogicalColour@@ -483,7 +483,7 @@ 		else return {-to Parser-monad-} qualifiedMove #else /* Parsec */ 	-> Parsec.Parser (StandardAlgebraic x y)-{-# SPECIALISE parser :: ExplicitEnPassant -> ValidateMoves -> Model.Game.Game T.X T.Y -> Parsec.Parser (StandardAlgebraic T.X T.Y) #-}+{-# SPECIALISE parser :: ExplicitEnPassant -> ValidateMoves -> Model.Game.Game Type.Length.X Type.Length.Y -> Parsec.Parser (StandardAlgebraic Type.Length.X Type.Length.Y) #-} parser explicitEnPassant validateMoves game	= let 	nextLogicalColour			= Model.Game.getNextLogicalColour game 	(longCastlingMove, shortCastlingMove)	= Component.CastlingMove.getLongAndShortMoves nextLogicalColour

@@ -28,6 +28,7 @@ 	xpickle ) where +import			Control.Arrow((|||)) import qualified	Text.XML.HXT.Arrow.Pickle	as HXT  {-@@ -39,7 +40,7 @@ -- | Pickler for an arbitrary datum of type 'Either'. xpickle :: HXT.PU l -> HXT.PU r -> HXT.PU (Either l r) xpickle lPickler rPickler	= HXT.xpAlt (-	const 0 `either` const 1	-- Index into the subsequent pickler-list.+	const 0 ||| const 1	-- Index into the subsequent pickler-list.  ) [ 	HXT.xpWrap ( 		Left,		-- Construct.

@@ -55,6 +55,7 @@ 	isBadRequest ) where +import			Control.Arrow((|||)) import qualified	Control.Exception import qualified	Data.Typeable @@ -86,10 +87,10 @@ instance Control.Exception.Exception Exception  instance Show Exception where-	showsPrec _ MkException {+	showsPrec precedence MkException { 		getType		= eitherBadDataOrBadRequest, 		getDetails	= details-	} = either shows shows eitherBadDataOrBadRequest . showString "; " . showString details+	} = (showsPrec precedence ||| showsPrec precedence) eitherBadDataOrBadRequest . showString "; " . showString details  -- | Constructor. mkDuplicateData :: String -> Exception

@@ -1,35 +0,0 @@-{-# OPTIONS_GHC -fno-warn-orphans #-}-{--	Copyright (C) 2018 Dr. Alistair Ward--	This file is part of WeekDaze.--	WeekDaze 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 3 of the License, or-	(at your option) any later version.--	WeekDaze 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 WeekDaze.  If not, see <http://www.gnu.org/licenses/>.--}-{- |- [@AUTHOR@]	Dr. Alistair Ward-- [@DESCRIPTION@]	Defines a /pickler/ for 'Float' & 'Double'.--}--module BishBosh.Data.Float() where--import qualified	Text.XML.HXT.Arrow.Pickle	as HXT--instance HXT.XmlPickler Float where-	xpickle	= HXT.xpPrim--instance HXT.XmlPickler Double where-	xpickle	= HXT.xpPrim-

@@ -1,4 +1,3 @@-{-# OPTIONS_GHC -fno-warn-orphans #-} {- 	Copyright (C) 2018 Dr. Alistair Ward @@ -20,7 +19,7 @@ {- |  [@AUTHOR@]	Dr. Alistair Ward - [@DESCRIPTION@]	Arbitrary operations for integral types.+ [@DESCRIPTION@]	Arbitrary operations for numeric types. -}  module BishBosh.Data.Integral(@@ -29,31 +28,7 @@ ) where  import qualified	Data.Char-import qualified	Data.Int import qualified	Data.List-import qualified	Data.Word-import qualified	Text.XML.HXT.Arrow.Pickle	as HXT--instance HXT.XmlPickler Data.Int.Int8 where-	xpickle	= HXT.xpPrim--instance HXT.XmlPickler Data.Int.Int16 where-	xpickle	= HXT.xpPrim--instance HXT.XmlPickler Data.Int.Int32 where-	xpickle	= HXT.xpPrim--instance HXT.XmlPickler Data.Word.Word8 where-	xpickle	= HXT.xpPrim--instance HXT.XmlPickler Data.Word.Word16 where-	xpickle	= HXT.xpPrim--instance HXT.XmlPickler Data.Word.Word32 where-	xpickle	= HXT.xpPrim--instance HXT.XmlPickler Data.Word.Word where-	xpickle	= HXT.xpPrim  {- | 	* N.B. much faster than the instance of 'Read' for the integral type. TODO: compare with 'Numeric.readDec'.

@@ -32,3 +32,4 @@ -- | Whether the specified number lies within the closed unit-interval, @[0,1]@; <https://en.wikipedia.org/wiki/Unit_interval>. inClosedUnitInterval :: (Num n, Ord n) => n -> Bool inClosedUnitInterval	= uncurry (&&) . ((>= 0) &&& (<= 1))+

@@ -1,41 +0,0 @@-{--	Copyright (C) 2018 Dr. Alistair Ward--	This file is part of BishBosh.--	BishBosh 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 3 of the License, or-	(at your option) any later version.--	BishBosh 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 BishBosh.  If not, see <http://www.gnu.org/licenses/>.--}-{- |- [@AUTHOR@]	Dr. Alistair Ward-- [@DESCRIPTION@]--}--module BishBosh.Data.Time(--- * Functions-	showsTimeAsSeconds,-	measureElapsedTime- ) where--import qualified	Data.Time.Clock-import qualified	Text.Printf---- | Shows a time-difference as a number of seconds, to the required precision.-showsTimeAsSeconds :: Text.Printf.PrintfArg i => i -> Data.Time.Clock.NominalDiffTime -> ShowS-showsTimeAsSeconds nDecimalDigits time	= showString $ Text.Printf.printf "%.*fs" nDecimalDigits (realToFrac time :: Double)---- | Measure the time which has elapsed since that specified.-measureElapsedTime :: Data.Time.Clock.UTCTime -> IO Data.Time.Clock.NominalDiffTime-measureElapsedTime startUTCTime	= (`Data.Time.Clock.diffUTCTime` startUTCTime) `fmap` Data.Time.Clock.getCurrentTime-

@@ -49,12 +49,8 @@ import			Control.Applicative((<|>)) import			Control.Arrow((&&&)) import			Data.Array.IArray((!))-import qualified	BishBosh.Attribute.CriterionValue			as Attribute.CriterionValue-import qualified	BishBosh.Attribute.Direction				as Attribute.Direction import qualified	BishBosh.Attribute.LogicalColour			as Attribute.LogicalColour import qualified	BishBosh.Attribute.MoveType				as Attribute.MoveType-import qualified	BishBosh.Attribute.RankValues				as Attribute.RankValues-import qualified	BishBosh.Attribute.WeightedMeanAndCriterionValues	as Attribute.WeightedMeanAndCriterionValues import qualified	BishBosh.Cartesian.Abscissa				as Cartesian.Abscissa import qualified	BishBosh.Cartesian.Coordinates				as Cartesian.Coordinates import qualified	BishBosh.Cartesian.Ordinate				as Cartesian.Ordinate@@ -65,35 +61,32 @@ import qualified	BishBosh.Component.Turn					as Component.Turn import qualified	BishBosh.Input.CriteriaWeights				as Input.CriteriaWeights import qualified	BishBosh.Input.EvaluationOptions			as Input.EvaluationOptions+import qualified	BishBosh.Input.RankValues				as Input.RankValues+import qualified	BishBosh.Metric.CriterionValue				as Metric.CriterionValue+import qualified	BishBosh.Metric.WeightedMeanAndCriterionValues		as Metric.WeightedMeanAndCriterionValues import qualified	BishBosh.Model.Game					as Model.Game-import qualified	BishBosh.Model.GameTerminationReason			as Model.GameTerminationReason import qualified	BishBosh.Property.Opposable				as Property.Opposable+import qualified	BishBosh.Rule.GameTerminationReason			as Rule.GameTerminationReason import qualified	BishBosh.State.Board					as State.Board import qualified	BishBosh.State.CastleableRooksByLogicalColour		as State.CastleableRooksByLogicalColour-import qualified	BishBosh.Types						as T+import qualified	BishBosh.Type.Count					as Type.Count+import qualified	BishBosh.Type.Length					as Type.Length+import qualified	BishBosh.Type.Mass					as Type.Mass import qualified	Control.Monad.Reader import qualified	Data.Array.IArray import qualified	Data.List import qualified	Data.Map.Strict import qualified	Data.Maybe -#ifdef USE_PARALLEL-import qualified	Control.DeepSeq-#endif- #ifdef USE_UNBOXED_ARRAYS import qualified	Data.Array.Unboxed #endif  -- | Construct a criterion-value from a piece-square value.-mkPieceSquareCriterionValue :: (-	Fractional	criterionValue,-	Ord		criterionValue,-	Real		pieceSquareValue- ) => pieceSquareValue -> Attribute.CriterionValue.CriterionValue criterionValue-mkPieceSquareCriterionValue	= Attribute.CriterionValue.mkCriterionValue . (+mkPieceSquareCriterionValue :: Real pieceSquareValue => pieceSquareValue -> Metric.CriterionValue.CriterionValue+mkPieceSquareCriterionValue	= fromRational . ( 	/ fromIntegral Component.Piece.nPiecesPerSide- ) . realToFrac+ ) . toRational  -- | Measures the piece-square value from the perspective of the last player to move. measurePieceSquareValue :: (@@ -109,7 +102,7 @@ 	=> Component.PieceSquareByCoordinatesByRank.PieceSquareByCoordinatesByRank x y pieceSquareValue 	-> Model.Game.Game x y 	-> pieceSquareValue-{-# SPECIALISE measurePieceSquareValue :: Component.PieceSquareByCoordinatesByRank.PieceSquareByCoordinatesByRank T.X T.Y T.PieceSquareValue -> Model.Game.Game T.X T.Y -> T.PieceSquareValue #-}+{-# SPECIALISE measurePieceSquareValue :: Component.PieceSquareByCoordinatesByRank.PieceSquareByCoordinatesByRank Type.Length.X Type.Length.Y Type.Mass.PieceSquareValue -> Model.Game.Game Type.Length.X Type.Length.Y -> Type.Mass.PieceSquareValue #-} measurePieceSquareValue pieceSquareByCoordinatesByRank game 	| Attribute.LogicalColour.isBlack $ Model.Game.getNextLogicalColour game	= difference 	| otherwise									= negate difference	-- Represent the piece-square value from Black's perspective.@@ -138,7 +131,7 @@ 	-> Component.PieceSquareByCoordinatesByRank.PieceSquareByCoordinatesByRank x y pieceSquareValue 	-> Model.Game.Game x y 	-> pieceSquareValue-{-# SPECIALISE measurePieceSquareValueIncrementally :: T.PieceSquareValue -> Component.PieceSquareByCoordinatesByRank.PieceSquareByCoordinatesByRank T.X T.Y T.PieceSquareValue -> Model.Game.Game T.X T.Y -> T.PieceSquareValue #-}+{-# SPECIALISE measurePieceSquareValueIncrementally :: Type.Mass.PieceSquareValue -> Component.PieceSquareByCoordinatesByRank.PieceSquareByCoordinatesByRank Type.Length.X Type.Length.Y Type.Mass.PieceSquareValue -> Model.Game.Game Type.Length.X Type.Length.Y -> Type.Mass.PieceSquareValue #-} measurePieceSquareValueIncrementally previousPieceSquareValue pieceSquareByCoordinatesByRank game 	| Attribute.MoveType.isQuiet $ Component.QualifiedMove.getMoveType qualifiedMove	= let 		findPieceSquareValues coordinatesList	= Component.PieceSquareByCoordinatesByRank.findPieceSquareValues (@@ -158,26 +151,24 @@ 		qualifiedMove	= Component.Turn.getQualifiedMove turn  -- | Measure the arithmetic difference between the total /rank-value/ of the /piece/s currently held by either side; <https://www.chessprogramming.org/Material>.-measureValueOfMaterial :: (-	Fractional	criterionValue,-	Fractional	rankValue,-	Ord		criterionValue,-	Real		rankValue- )-	=> Attribute.RankValues.RankValues rankValue+measureValueOfMaterial+	:: Input.RankValues.RankValues+	-> Type.Mass.RankValue	-- ^ Maximum total rank-value. 	-> Model.Game.Game x y-	-> Attribute.CriterionValue.CriterionValue criterionValue--- {-# SPECIALISE measureValueOfMaterial :: Attribute.RankValues.RankValues T.RankValue -> Model.Game.Game T.X T.Y -> Attribute.CriterionValue.CriterionValue T.CriterionValue #-}-measureValueOfMaterial rankValues game	= Attribute.CriterionValue.mkCriterionValue . (-	/ fromIntegral Component.Piece.nPiecesPerSide	-- Normalise.- ) . realToFrac . (+	-> Metric.CriterionValue.CriterionValue+-- {-# SPECIALISE measureValueOfMaterial :: Input.RankValues.RankValues -> Type.Mass.RankValue -> Model.Game.Game Type.Length.X Type.Length.Y -> Metric.CriterionValue.CriterionValue #-}+measureValueOfMaterial rankValues maximumTotalRankValue game	= fromRational . (+	/ toRational maximumTotalRankValue -- Normalise.+ ) . ( 	if Attribute.LogicalColour.isBlack $ Model.Game.getNextLogicalColour game 		then id		-- White just moved. 		else negate	-- Black just moved.  ) . Data.List.foldl' (-	\acc (rank, nPieces) -> if nPieces == 0-		then acc	-- Avoid calling 'Attribute.RankValues.findRankValue'.-		else acc + Attribute.RankValues.findRankValue rank rankValues * fromIntegral nPieces+	\acc (rank, nPiecesDifference) -> if nPiecesDifference == 0+		then acc	-- Avoid calling 'Input.RankValues.findRankValue'.+		else acc + toRational (+			Input.RankValues.findRankValue rank rankValues+		) * fromIntegral nPiecesDifference  ) 0 . Data.Array.IArray.assocs . State.Board.getNPiecesDifferenceByRank {-which arbitrarily counts White pieces as positive & Black as negative-} $ Model.Game.getBoard game  {- |@@ -192,7 +183,7 @@ 	=> getWeightOfMobility * 1 > weightOfMaterial * (8.8 / 102.47) 	=> getWeightOfMobility > weightOfMaterial / 11.6 -	The corollary is that one probably shouldn't sacrifice even a @Knight@ to temporarily reduce one's opponent mobility to one.+	The corollary is that one probably shouldn't sacrifice even a @Knight@ to temporarily reduce one's opponent's mobility to one. 	measureValueOfMobility = 0.5 when mobility = 1, 	=> getWeightOfMobility * 0.5 < weightOfMaterial * (3.2 / 102.47) 	=> getWeightOfMobility < weightOfMaterial / 16.0@@ -201,28 +192,23 @@ 	This presents a paradox ! -} measureValueOfMobility :: (-	Enum		x,-	Enum		y,-	Fractional	criterionValue,-	Ord		criterionValue,-	Ord		x,-	Ord		y,-	Show		x,-	Show		y- ) => Model.Game.Game x y -> Attribute.CriterionValue.CriterionValue criterionValue-{-# SPECIALISE measureValueOfMobility :: Model.Game.Game T.X T.Y -> Attribute.CriterionValue.CriterionValue T.CriterionValue #-}-measureValueOfMobility game	= Attribute.CriterionValue.mkCriterionValue . uncurry (-) . (+	Enum	x,+	Enum	y,+	Ord	x,+	Ord	y,+	Show	x,+	Show	y+ ) => Model.Game.Game x y -> Metric.CriterionValue.CriterionValue+{-# SPECIALISE measureValueOfMobility :: Model.Game.Game Type.Length.X Type.Length.Y -> Metric.CriterionValue.CriterionValue #-}+measureValueOfMobility game	= fromRational . uncurry (-) . ( 	measureConstriction &&& measureConstriction . Property.Opposable.getOpposite {-recent mover-}  ) $ Model.Game.getNextLogicalColour game where-	measureConstriction logicalColour	= recip . fromIntegral . succ {-avoid divide-by-zero-} $ Model.Game.countMovesAvailableTo logicalColour game+	measureConstriction logicalColour	= recip . fromIntegral {-NPlies-} . succ {-avoid divide-by-zero-} $ Model.Game.countPliesAvailableTo logicalColour game  -- | Measure the arithmetic difference between the potential to /Castle/, on either side.-measureValueOfCastlingPotential :: (-	Fractional	criterionValue,-	Ord		criterionValue- ) => Model.Game.Game x y -> Attribute.CriterionValue.CriterionValue criterionValue--- {-# SPECIALISE measureValueOfCastlingPotential :: Model.Game.Game T.X T.Y -> Attribute.CriterionValue.CriterionValue T.CriterionValue #-}-measureValueOfCastlingPotential game	= Attribute.CriterionValue.mkCriterionValue . uncurry (-) . (+measureValueOfCastlingPotential :: Model.Game.Game x y -> Metric.CriterionValue.CriterionValue+-- {-# SPECIALISE measureValueOfCastlingPotential :: Model.Game.Game Type.Length.X Type.Length.Y -> Metric.CriterionValue.CriterionValue #-}+measureValueOfCastlingPotential game	= fromRational . uncurry (-) . ( 	castlingPotential . Property.Opposable.getOpposite {-recent mover-} &&& castlingPotential  ) $ Model.Game.getNextLogicalColour game where 	castlingPotential	= Data.Maybe.maybe 1 {-have Castled-} (@@ -238,18 +224,15 @@  	* CAVEAT: this is a negative attribute, so the weighted normalised value shouldn't exceed the reduction due to 'measureValueOfMaterial' resulting from a @Pawn@-sacrifice. -}-measureValueOfDoubledPawns :: (-	Fractional	criterionValue,-	Ord		criterionValue- ) => Model.Game.Game x y -> Attribute.CriterionValue.CriterionValue criterionValue--- {-# SPECIALISE measureValueOfDoubledPawns :: Model.Game.Game T.X T.Y -> Attribute.CriterionValue.CriterionValue T.CriterionValue #-}-measureValueOfDoubledPawns game	= Attribute.CriterionValue.mkCriterionValue . (+measureValueOfDoubledPawns :: Model.Game.Game x y -> Metric.CriterionValue.CriterionValue+-- {-# SPECIALISE measureValueOfDoubledPawns :: Model.Game.Game Type.Length.X Type.Length.Y -> Metric.CriterionValue.CriterionValue #-}+measureValueOfDoubledPawns game	= fromRational . ( 	/ 6	-- Normalise to [-1 .. 1]; the optimal scenario is all files containing one Pawn; the worst scenario is two files each containing four Pawns, all but one per file of which are counted as doubled.- ) . fromIntegral . uncurry (-) . (+ ) . fromIntegral {-NPieces-} . uncurry (-) . ( 	countDoubledPawns &&& countDoubledPawns . Property.Opposable.getOpposite {-recent mover-}  ) $ Model.Game.getNextLogicalColour game where 	countDoubledPawns logicalColour	= uncurry (-) . (-		Data.Map.Strict.foldl' (+) 0 &&& Data.Map.Strict.size {-one Pawn can't be considered to be doubled, so substract one Pawn per column-}+		Data.Map.Strict.foldl' (+) 0 &&& fromIntegral . Data.Map.Strict.size {-one Pawn can't be considered to be doubled, so substract one Pawn per column-} 	 ) $ State.Board.getNPawnsByFileByLogicalColour (Model.Game.getBoard game) ! logicalColour  {- |@@ -257,19 +240,14 @@  	* CAVEAT: this is a negative attribute, so the weighted normalised value shouldn't exceed the reduction due to 'measureValueOfMaterial' resulting from a @Pawn@-sacrifice. -}-measureValueOfIsolatedPawns :: (-	Enum		x,-	Fractional	criterionValue,-	Ord		criterionValue,-	Ord		x- ) => Model.Game.Game x y -> Attribute.CriterionValue.CriterionValue criterionValue-{-# SPECIALISE measureValueOfIsolatedPawns :: Model.Game.Game T.X T.Y -> Attribute.CriterionValue.CriterionValue T.CriterionValue #-}-measureValueOfIsolatedPawns game	= Attribute.CriterionValue.mkCriterionValue . (-	/ fromIntegral Cartesian.Abscissa.xLength	-- Normalise to [-1 .. 1]; the optimal scenario is eight files each containing one Pawn & the worst scenario is all Pawns isolated (e.g. 4 alternate files of 2, 2 separate files or 4, ...).- ) . fromIntegral . uncurry (-) . (+measureValueOfIsolatedPawns :: (Enum x, Ord x) => Model.Game.Game x y -> Metric.CriterionValue.CriterionValue+{-# SPECIALISE measureValueOfIsolatedPawns :: Model.Game.Game Type.Length.X Type.Length.Y -> Metric.CriterionValue.CriterionValue #-}+measureValueOfIsolatedPawns game	= fromRational . (+	/ fromIntegral {-Int-} Cartesian.Abscissa.xLength	-- Normalise to [-1 .. 1]; the optimal scenario is eight files each containing one Pawn & the worst scenario is all Pawns isolated (e.g. 4 alternate files of 2, 2 separate files or 4, ...).+ ) . fromIntegral {-NPieces-} . uncurry (-) . ( 	countIsolatedPawns &&& countIsolatedPawns . Property.Opposable.getOpposite {-recent mover-}  ) $ Model.Game.getNextLogicalColour game where-	countIsolatedPawns :: Attribute.LogicalColour.LogicalColour -> Component.Piece.NPieces+	countIsolatedPawns :: Attribute.LogicalColour.LogicalColour -> Type.Count.NPieces 	countIsolatedPawns logicalColour	= Data.Map.Strict.foldlWithKey' ( 		\acc x nPawns -> ( 			if (`Data.Map.Strict.member` nPawnsByFile) `any` Cartesian.Abscissa.getAdjacents x@@ -280,22 +258,17 @@ 		nPawnsByFile	= State.Board.getNPawnsByFileByLogicalColour (Model.Game.getBoard game) ! logicalColour  -- | Measure the arithmetic difference between the number of /passed/ @Pawn@s on either side; <https://www.chessprogramming.org/Passed_Pawn>.-measureValueOfPassedPawns :: forall x y criterionValue. (-	Enum		y,-	Fractional	criterionValue,-	Ord		criterionValue- ) => Model.Game.Game x y -> Attribute.CriterionValue.CriterionValue criterionValue-{-# SPECIALISE measureValueOfPassedPawns :: Model.Game.Game T.X T.Y -> Attribute.CriterionValue.CriterionValue T.CriterionValue #-}-measureValueOfPassedPawns game	= Attribute.CriterionValue.mkCriterionValue . (-	/ fromIntegral Cartesian.Abscissa.xLength	-- Normalise to [-1 .. 1].+measureValueOfPassedPawns :: forall x y. Enum y => Model.Game.Game x y -> Metric.CriterionValue.CriterionValue+{-# SPECIALISE measureValueOfPassedPawns :: Model.Game.Game Type.Length.X Type.Length.Y -> Metric.CriterionValue.CriterionValue #-}+measureValueOfPassedPawns game	= fromRational . (+	/ fromIntegral {-Int-} Cartesian.Abscissa.xLength	-- Normalise to [-1 .. 1].  ) . uncurry (-) . ( 	valuePassedPawns . Property.Opposable.getOpposite {-recent mover-} &&& valuePassedPawns  ) $ Model.Game.getNextLogicalColour game where-	valuePassedPawns :: Attribute.LogicalColour.LogicalColour -> criterionValue 	valuePassedPawns logicalColour	= Data.List.foldl' (-		\acc -> (acc +) . recip {-value increases exponentially as distance to promotion decreases-} . fromIntegral . abs . subtract (+		\acc -> (acc +) . recip {-value increases exponentially as distance to promotion decreases-} . fromIntegral {-Int-} . abs . subtract ( 			fromEnum (-				Cartesian.Ordinate.lastRank logicalColour	:: y+				Cartesian.Ordinate.lastRank logicalColour	:: y	-- N.B.: ScopedTypeVariables. 			) 		) . fromEnum . Cartesian.Coordinates.getY	-- Measure the distance to promotion. 	 ) 0 $ State.Board.getPassedPawnCoordinatesByLogicalColour (Model.Game.getBoard game) ! logicalColour@@ -303,16 +276,18 @@ {- | 	* The constant maximum total number of times the /piece/s of either side, can be defended. -	* This calculation assumes that:+	* Assumes all Pawns have been Queened. -	** every /piece/ can defend another in every /direction/ it can attack,-	which is impossible, since in a 2-D board one can always draw a perimeter around the /piece/s,-	beyond which there're zero /pieces/ to defend, so the outer /piece/s can never be fully utilised;+	* CAVEAT: assuming the optimal arrangement of pieces: -	** all @Pawn@s have been /queened/, which is unrealistic.+	RQQB	= 3 + 7 + 3 + 2	= 15+	QQQN	= 4 + 6 + 8 + 4	= 22+	NQQK	= 4 + 8 + 6 + 0	= 18+	BQQR	= 2 + 3 + 7 + 3	= 15+				= 70 -}-maximumDefended :: Component.Piece.NPieces-maximumDefended	= (9 {-Queens-} + 1 {-King-} + 2 {-Knights-} + 2 {-Rooks + Bishops-}) * Attribute.Direction.nDistinctDirections+maximumDefended :: Type.Count.NPieces+maximumDefended	= 70  {- | 	* Measure the normalised arithmetic difference between the number of /piece/s defending each of one's own, on either side.@@ -326,14 +301,11 @@  	* CAVEAT: this criterion competes with /mobility/, since each defended /piece/ blocks the path of the defender. -}-measureValueOfDefence :: (-	Fractional	criterionValue,-	Ord		criterionValue- ) => Model.Game.Game x y -> Attribute.CriterionValue.CriterionValue criterionValue--- {-# SPECIALISE measureValueOfDefence :: Model.Game.Game T.X T.Y -> Attribute.CriterionValue.CriterionValue T.CriterionValue #-}-measureValueOfDefence game	= Attribute.CriterionValue.mkCriterionValue . (-	/ fromIntegral maximumDefended	-- Normalise.- ) . fromIntegral . uncurry (-) . (+measureValueOfDefence :: Model.Game.Game x y -> Metric.CriterionValue.CriterionValue+-- {-# SPECIALISE measureValueOfDefence :: Model.Game.Game Type.Length.X Type.Length.Y -> Metric.CriterionValue.CriterionValue #-}+measureValueOfDefence game	= fromRational . (+	/ fromIntegral {-NPieces-} maximumDefended	-- Normalise.+ ) . fromIntegral {-NPieces-} . uncurry (-) . ( 	(! Property.Opposable.getOpposite {-recent mover-} nextLogicalColour) &&& (! nextLogicalColour)  ) . State.Board.summariseNDefendersByLogicalColour $ Model.Game.getBoard game where 	nextLogicalColour	= Model.Game.getNextLogicalColour game@@ -350,50 +322,39 @@ 	* Many possible criteria aren't measured because they're, either currently or imminently, represented by those that are, typically by 'measureValueOfMaterial'. -} evaluateFitness :: (-#ifdef USE_PARALLEL-	Control.DeepSeq.NFData					criterionValue,-#endif #ifdef USE_UNBOXED_ARRAYS 	Data.Array.Unboxed.IArray Data.Array.Unboxed.UArray	pieceSquareValue,	-- Requires 'FlexibleContexts'. The unboxed representation of the array-element must be defined (& therefore must be of fixed size). #endif 	Enum							x, 	Enum							y,-	Fractional						criterionValue, 	Fractional						pieceSquareValue,-	Fractional						rankValue,-	Fractional						weightedMean, 	Ord							x, 	Ord							y,-	Real							criterionValue,-	Real							criterionWeight, 	Real							pieceSquareValue,-	Real							rankValue, 	Show							x, 	Show							y  ) 	=> Maybe pieceSquareValue	-- ^ An optional value for the specified game. 	-> Model.Game.Game x y-	-> Input.EvaluationOptions.Reader criterionWeight pieceSquareValue rankValue x y (-		Attribute.WeightedMeanAndCriterionValues.WeightedMeanAndCriterionValues weightedMean criterionValue-	)-{-# SPECIALISE evaluateFitness :: Maybe T.PieceSquareValue -> Model.Game.Game T.X T.Y -> Input.EvaluationOptions.Reader T.CriterionWeight T.PieceSquareValue T.RankValue T.X T.Y (Attribute.WeightedMeanAndCriterionValues.WeightedMeanAndCriterionValues T.WeightedMean T.CriterionValue) #-}+	-> Input.EvaluationOptions.Reader pieceSquareValue x y Metric.WeightedMeanAndCriterionValues.WeightedMeanAndCriterionValues+{-# SPECIALISE evaluateFitness :: Maybe Type.Mass.PieceSquareValue -> Model.Game.Game Type.Length.X Type.Length.Y -> Input.EvaluationOptions.Reader Type.Mass.PieceSquareValue Type.Length.X Type.Length.Y Metric.WeightedMeanAndCriterionValues.WeightedMeanAndCriterionValues #-} evaluateFitness maybePieceSquareValue game-	| Just gameTerminationReason <- Model.Game.getMaybeTerminationReason game	= return {-to Reader-monad-} $ Attribute.WeightedMeanAndCriterionValues.mkWeightedMeanAndCriterionValues (-		if Model.GameTerminationReason.isCheckMate gameTerminationReason+	| Just gameTerminationReason <- Model.Game.getMaybeTerminationReason game	= return {-to Reader-monad-} $ Metric.WeightedMeanAndCriterionValues.mkWeightedMeanAndCriterionValues (+		if Rule.GameTerminationReason.isCheckMate gameTerminationReason 			then 1	-- The last player to move, has won. 			else 0	-- A draw. 	) [] 	| otherwise	= do 		criteriaWeights				<- Control.Monad.Reader.asks Input.EvaluationOptions.getCriteriaWeights-		rankValues				<- Control.Monad.Reader.asks Input.EvaluationOptions.getRankValues+		rankValuePair				<- Control.Monad.Reader.asks $ Input.EvaluationOptions.getRankValues &&& Input.EvaluationOptions.getMaximumTotalRankValue 		maybePieceSquareByCoordinatesByRank	<- Control.Monad.Reader.asks Input.EvaluationOptions.getMaybePieceSquareByCoordinatesByRank  		return {-to Reader-monad-} $ Input.CriteriaWeights.calculateWeightedMean criteriaWeights (-			measureValueOfMaterial rankValues game+			uncurry measureValueOfMaterial rankValuePair game 		 ) ( 			measureValueOfMobility game 		 ) (-			Data.Maybe.maybe Attribute.CriterionValue.zero mkPieceSquareCriterionValue $ maybePieceSquareValue <|> fmap (+			Data.Maybe.maybe 0 mkPieceSquareCriterionValue $ maybePieceSquareValue <|> fmap ( 				`measurePieceSquareValue` game 			) maybePieceSquareByCoordinatesByRank 		 ) (

@@ -66,22 +66,24 @@  ) where  import			Control.Arrow((&&&))-import qualified	BishBosh.Attribute.RankValues				as Attribute.RankValues-import qualified	BishBosh.Attribute.WeightedMeanAndCriterionValues	as Attribute.WeightedMeanAndCriterionValues-import qualified	BishBosh.Component.QualifiedMove			as Component.QualifiedMove-import qualified	BishBosh.Component.Turn					as Component.Turn-import qualified	BishBosh.Component.Zobrist				as Component.Zobrist-import qualified	BishBosh.Data.RoseTree					as Data.RoseTree-import qualified	BishBosh.Evaluation.Fitness				as Evaluation.Fitness-import qualified	BishBosh.Evaluation.QuantifiedGame			as Evaluation.QuantifiedGame-import qualified	BishBosh.Input.EvaluationOptions			as Input.EvaluationOptions-import qualified	BishBosh.Input.SearchOptions				as Input.SearchOptions-import qualified	BishBosh.Model.Game					as Model.Game-import qualified	BishBosh.Model.GameTree					as Model.GameTree-import qualified	BishBosh.Notation.MoveNotation				as Notation.MoveNotation-import qualified	BishBosh.Property.Arboreal				as Property.Arboreal-import qualified	BishBosh.Property.Null					as Property.Null-import qualified	BishBosh.Types						as T+import qualified	BishBosh.Component.QualifiedMove		as Component.QualifiedMove+import qualified	BishBosh.Component.Turn				as Component.Turn+import qualified	BishBosh.Component.Zobrist			as Component.Zobrist+import qualified	BishBosh.Data.RoseTree				as Data.RoseTree+import qualified	BishBosh.Evaluation.Fitness			as Evaluation.Fitness+import qualified	BishBosh.Evaluation.QuantifiedGame		as Evaluation.QuantifiedGame+import qualified	BishBosh.Input.EvaluationOptions		as Input.EvaluationOptions+import qualified	BishBosh.Input.RankValues			as Input.RankValues+import qualified	BishBosh.Input.SearchOptions			as Input.SearchOptions+import qualified	BishBosh.Metric.WeightedMeanAndCriterionValues	as Metric.WeightedMeanAndCriterionValues+import qualified	BishBosh.Model.Game				as Model.Game+import qualified	BishBosh.Model.GameTree				as Model.GameTree+import qualified	BishBosh.Notation.MoveNotation			as Notation.MoveNotation+import qualified	BishBosh.Property.Arboreal			as Property.Arboreal+import qualified	BishBosh.Property.Null				as Property.Null+import qualified	BishBosh.Type.Crypto				as Type.Crypto+import qualified	BishBosh.Type.Length				as Type.Length+import qualified	BishBosh.Type.Mass				as Type.Mass import qualified	Control.Arrow import qualified	Control.Monad.Reader import qualified	Data.Array.IArray@@ -89,56 +91,48 @@ import qualified	Data.Maybe import qualified	Data.Tree -#ifdef USE_PARALLEL-import qualified	Control.DeepSeq-#endif- #ifdef USE_UNBOXED_ARRAYS import qualified	Data.Array.Unboxed #endif  -- | Define a node in the tree to contain the hash of a /game/ & an evaluation of the fitness of that /game/.-data NodeLabel x y positionHash criterionValue weightedMean	= MkNodeLabel {+data NodeLabel x y positionHash	= MkNodeLabel { 	getPositionHash		:: positionHash,	-- ^ The hash of the /game/ contained in 'getQuantifiedGame'.-	getQuantifiedGame	:: Evaluation.QuantifiedGame.QuantifiedGame x y criterionValue weightedMean+	getQuantifiedGame	:: Evaluation.QuantifiedGame.QuantifiedGame x y } deriving (Eq, Show) -instance (Enum x, Enum y, Real weightedMean) => Notation.MoveNotation.ShowNotationFloat (NodeLabel x y positionHash criterionValue weightedMean) where+instance (Enum x, Enum y) => Notation.MoveNotation.ShowNotationFloat (NodeLabel x y positionHash) where 	showsNotationFloat moveNotation showsDouble MkNodeLabel { getQuantifiedGame = quantifiedGame }	= Notation.MoveNotation.showsNotation moveNotation ( 		Evaluation.QuantifiedGame.getLastTurn quantifiedGame 	 ) . showString "\t=> " . showsDouble (-		realToFrac . Attribute.WeightedMeanAndCriterionValues.getWeightedMean $ Evaluation.QuantifiedGame.getWeightedMeanAndCriterionValues quantifiedGame+		realToFrac . Metric.WeightedMeanAndCriterionValues.getWeightedMean $ Evaluation.QuantifiedGame.getWeightedMeanAndCriterionValues quantifiedGame 	 ) -instance Property.Null.Null (NodeLabel x y positionHash criterionValue weightedMean) where+instance Property.Null.Null (NodeLabel x y positionHash) where 	isNull MkNodeLabel { getQuantifiedGame = quantifiedGame }	= Property.Null.isNull quantifiedGame  -- | Whether the last qualifiedMove of the /game/ in a node, matches a specified /QualifiedMove/.-equalsLastQualifiedMove :: (Eq x, Eq y) => Component.QualifiedMove.QualifiedMove x y -> Data.RoseTree.IsMatch (NodeLabel x y positionHash criterionValue weightedMean)+equalsLastQualifiedMove :: (Eq x, Eq y) => Component.QualifiedMove.QualifiedMove x y -> Data.RoseTree.IsMatch (NodeLabel x y positionHash) equalsLastQualifiedMove qualifiedMove MkNodeLabel { getQuantifiedGame = quantifiedGame }	= (== qualifiedMove) . Component.Turn.getQualifiedMove $ Evaluation.QuantifiedGame.getLastTurn quantifiedGame  -- | The tree resulting from each possible move-choice applied to a /game/, including a position-hash & an evaluation of the resulting fitness.-type BarePositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean	= Data.Tree.Tree (NodeLabel x y positionHash criterionValue weightedMean)+type BarePositionHashQuantifiedGameTree x y positionHash	= Data.Tree.Tree (NodeLabel x y positionHash)  -- | Accessor.-getRootQuantifiedGame' :: BarePositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean -> Evaluation.QuantifiedGame.QuantifiedGame x y criterionValue weightedMean+getRootQuantifiedGame' :: BarePositionHashQuantifiedGameTree x y positionHash -> Evaluation.QuantifiedGame.QuantifiedGame x y getRootQuantifiedGame' Data.Tree.Node { 	Data.Tree.rootLabel	= MkNodeLabel { getQuantifiedGame = quantifiedGame } } = quantifiedGame  -- | Wrap the bare tree.-newtype PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean	= MkPositionHashQuantifiedGameTree {-	deconstruct	:: BarePositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean+newtype PositionHashQuantifiedGameTree x y positionHash	= MkPositionHashQuantifiedGameTree {+	deconstruct	:: BarePositionHashQuantifiedGameTree x y positionHash } deriving Eq -instance Property.Arboreal.Prunable (PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean) where+instance Property.Arboreal.Prunable (PositionHashQuantifiedGameTree x y positionHash) where 	prune depth MkPositionHashQuantifiedGameTree { deconstruct = barePositionHashQuantifiedGameTree }	= MkPositionHashQuantifiedGameTree $ Property.Arboreal.prune depth barePositionHashQuantifiedGameTree -instance (-	Enum	x,-	Enum	y,-	Real	weightedMean- ) => Notation.MoveNotation.ShowNotationFloat (PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean) where+instance (Enum x, Enum y) => Notation.MoveNotation.ShowNotationFloat (PositionHashQuantifiedGameTree x y positionHash) where 	showsNotationFloat moveNotation showsDouble MkPositionHashQuantifiedGameTree { deconstruct = barePositionHashQuantifiedGameTree } = showString $ ( 		if Property.Null.isNull . Data.Tree.rootLabel $ barePositionHashQuantifiedGameTree 			then Data.RoseTree.drawForest toString . Data.Tree.subForest@@ -147,45 +141,36 @@ 		toString nodeLabel	= Notation.MoveNotation.showsNotationFloat moveNotation showsDouble nodeLabel ""  -- | Constructor.-fromBarePositionHashQuantifiedGameTree :: BarePositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean -> PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean+fromBarePositionHashQuantifiedGameTree :: BarePositionHashQuantifiedGameTree x y positionHash -> PositionHashQuantifiedGameTree x y positionHash fromBarePositionHashQuantifiedGameTree	= MkPositionHashQuantifiedGameTree  -- | Constructor. mkPositionHashQuantifiedGameTree :: (-#ifdef USE_PARALLEL-	Control.DeepSeq.NFData					criterionValue,-#endif 	Data.Array.IArray.Ix					x, #ifdef USE_UNBOXED_ARRAYS 	Data.Array.Unboxed.IArray Data.Array.Unboxed.UArray	pieceSquareValue,	-- Requires 'FlexibleContexts'. The unboxed representation of the array-element must be defined (& therefore must be of fixed size). #endif 	Data.Bits.Bits						positionHash,-	Fractional						criterionValue, 	Fractional						pieceSquareValue,-	Fractional						rankValue,-	Fractional						weightedMean, 	Integral						x, 	Integral						y,-	Real							criterionValue,-	Real							criterionWeight, 	Real							pieceSquareValue,-	Real							rankValue, 	Show							x, 	Show							y  )-	=> Input.EvaluationOptions.EvaluationOptions criterionWeight pieceSquareValue rankValue x y+	=> Input.EvaluationOptions.EvaluationOptions pieceSquareValue x y 	-> Input.SearchOptions.SearchOptions 	-> Component.Zobrist.Zobrist x y positionHash 	-> Model.GameTree.MoveFrequency x y 	-> Model.Game.Game x y	-- ^ The current state of the /game/.-	-> PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean+	-> PositionHashQuantifiedGameTree x y positionHash {-# SPECIALISE mkPositionHashQuantifiedGameTree-	:: Input.EvaluationOptions.EvaluationOptions T.CriterionWeight T.PieceSquareValue T.RankValue T.X T.Y+	:: Input.EvaluationOptions.EvaluationOptions Type.Mass.PieceSquareValue Type.Length.X Type.Length.Y 	-> Input.SearchOptions.SearchOptions-	-> Component.Zobrist.Zobrist T.X T.Y T.PositionHash-	-> Model.GameTree.MoveFrequency T.X T.Y-	-> Model.Game.Game T.X T.Y-	-> PositionHashQuantifiedGameTree T.X T.Y T.PositionHash T.CriterionValue T.WeightedMean+	-> Component.Zobrist.Zobrist Type.Length.X Type.Length.Y Type.Crypto.PositionHash+	-> Model.GameTree.MoveFrequency Type.Length.X Type.Length.Y+	-> Model.Game.Game Type.Length.X Type.Length.Y+	-> PositionHashQuantifiedGameTree Type.Length.X Type.Length.Y Type.Crypto.PositionHash  #-} mkPositionHashQuantifiedGameTree evaluationOptions searchOptions zobrist moveFrequency seedGame	= MkPositionHashQuantifiedGameTree ( 	if Input.EvaluationOptions.getIncrementalEvaluation evaluationOptions@@ -237,11 +222,11 @@ 	bareGameTree	= Model.GameTree.deconstruct . Model.GameTree.sortGameTree ( 		Input.SearchOptions.getMaybeCaptureMoveSortAlgorithm searchOptions 	 ) (-		`Attribute.RankValues.findRankValue` Input.EvaluationOptions.getRankValues evaluationOptions+		`Input.RankValues.findRankValue` Input.EvaluationOptions.getRankValues evaluationOptions 	 ) moveFrequency $ Model.GameTree.fromGame seedGame  -- | Accessor.-getRootPositionHash :: PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean -> positionHash+getRootPositionHash :: PositionHashQuantifiedGameTree x y positionHash -> positionHash getRootPositionHash MkPositionHashQuantifiedGameTree { 	deconstruct = Data.Tree.Node { 		Data.Tree.rootLabel	= MkNodeLabel { getPositionHash = positionHash }@@ -249,7 +234,7 @@ } = positionHash  -- | Accessor.-getRootQuantifiedGame :: PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean -> Evaluation.QuantifiedGame.QuantifiedGame x y criterionValue weightedMean+getRootQuantifiedGame :: PositionHashQuantifiedGameTree x y positionHash -> Evaluation.QuantifiedGame.QuantifiedGame x y getRootQuantifiedGame MkPositionHashQuantifiedGameTree { 	deconstruct = Data.Tree.Node { 		Data.Tree.rootLabel	= MkNodeLabel { getQuantifiedGame = quantifiedGame }@@ -258,29 +243,29 @@  -- | Forward request. reduce-	:: Data.RoseTree.IsMatch (NodeLabel x y positionHash criterionValue weightedMean)-	-> PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean-	-> Maybe (PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean)+	:: Data.RoseTree.IsMatch (NodeLabel x y positionHash)+	-> PositionHashQuantifiedGameTree x y positionHash+	-> Maybe (PositionHashQuantifiedGameTree x y positionHash) reduce isMatch MkPositionHashQuantifiedGameTree { deconstruct = barePositionHashQuantifiedGameTree }	= MkPositionHashQuantifiedGameTree `fmap` Data.RoseTree.reduce isMatch barePositionHashQuantifiedGameTree  -- | Forward request. traceRoute-	:: (Component.Turn.Turn x y -> Data.RoseTree.IsMatch (NodeLabel x y positionHash criterionValue weightedMean))-	-> PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean+	:: (Component.Turn.Turn x y -> Data.RoseTree.IsMatch (NodeLabel x y positionHash))+	-> PositionHashQuantifiedGameTree x y positionHash 	-> [Component.Turn.Turn x y]-	-> Maybe [NodeLabel x y positionHash criterionValue weightedMean]+	-> Maybe [NodeLabel x y positionHash] traceRoute isMatch MkPositionHashQuantifiedGameTree { deconstruct = barePositionHashQuantifiedGameTree }	= Data.RoseTree.traceRoute isMatch barePositionHashQuantifiedGameTree  -- | Follow the specified move-sequence down the /positionHashQuantifiedGameTree/. traceMatchingMoves 	:: (Eq x, Eq y)-	=> PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean+	=> PositionHashQuantifiedGameTree x y positionHash 	-> [Component.QualifiedMove.QualifiedMove x y]-	-> Maybe [NodeLabel x y positionHash criterionValue weightedMean]	-- ^ Returns 'Nothing', on failure to match a move.+	-> Maybe [NodeLabel x y positionHash]	-- ^ Returns 'Nothing', on failure to match a move. traceMatchingMoves MkPositionHashQuantifiedGameTree { deconstruct = barePositionHashQuantifiedGameTree }	= Data.RoseTree.traceRoute equalsLastQualifiedMove barePositionHashQuantifiedGameTree  -- | Amend the apex-game to reflect the resignation of the next player.-resign :: PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean -> PositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean+resign :: PositionHashQuantifiedGameTree x y positionHash -> PositionHashQuantifiedGameTree x y positionHash resign MkPositionHashQuantifiedGameTree { 	deconstruct	= barePositionHashQuantifiedGameTree@Data.Tree.Node { 		Data.Tree.rootLabel	= nodeLabel@MkNodeLabel { getQuantifiedGame = quantifiedGame }@@ -292,7 +277,7 @@ }  -- | Self-documentation.-type Forest x y positionHash criterionValue weightedMean	= [BarePositionHashQuantifiedGameTree x y positionHash criterionValue weightedMean]+type Forest x y positionHash	= [BarePositionHashQuantifiedGameTree x y positionHash]  {- | 	* Promotes the first matching /move/ to the head of the forest, then descends & recursively promotes the next matching move in the sub-forest.@@ -301,9 +286,9 @@ -} promoteMatchingMoves 	:: (Eq x, Eq y)-	=> [Component.QualifiedMove.QualifiedMove x y]			-- ^ The list of qualifiedMoves, which should be promoted at successively deeper levels in the tree.-	-> Forest x y positionHash criterionValue weightedMean-	-> Maybe (Forest x y positionHash criterionValue weightedMean)	-- ^ Returns 'Nothing' on failure to match a move.+	=> [Component.QualifiedMove.QualifiedMove x y]	-- ^ The list of qualifiedMoves, which should be promoted at successively deeper levels in the tree.+	-> Forest x y positionHash+	-> Maybe (Forest x y positionHash)		-- ^ Returns 'Nothing' on failure to match a move. promoteMatchingMoves	= Data.RoseTree.promote equalsLastQualifiedMove  {- |@@ -312,9 +297,9 @@ 	* N.B.: this can be used to dynamically re-order the forest using the killer heuristic. -} sortNonCaptureMoves-	:: (Forest x y positionHash criterionValue weightedMean -> Forest x y positionHash criterionValue weightedMean)-	-> Forest x y positionHash criterionValue weightedMean-	-> Forest x y positionHash criterionValue weightedMean+	:: (Forest x y positionHash -> Forest x y positionHash)+	-> Forest x y positionHash+	-> Forest x y positionHash sortNonCaptureMoves sortForest	= uncurry (++) . Control.Arrow.second sortForest . span ( 	Component.Turn.isCapture . Evaluation.QuantifiedGame.getLastTurn . getRootQuantifiedGame'	-- Shield any capture-moves, which were previously advanced by static sorting, from the sort.  )

@@ -54,17 +54,19 @@  ) where  import			Control.Arrow((&&&))-import qualified	BishBosh.Attribute.WeightedMeanAndCriterionValues	as Attribute.WeightedMeanAndCriterionValues-import qualified	BishBosh.Component.Move					as Component.Move-import qualified	BishBosh.Component.Turn					as Component.Turn-import qualified	BishBosh.Data.Exception					as Data.Exception-import qualified	BishBosh.Evaluation.Fitness				as Evaluation.Fitness-import qualified	BishBosh.Input.EvaluationOptions			as Input.EvaluationOptions-import qualified	BishBosh.Model.Game					as Model.Game-import qualified	BishBosh.Notation.MoveNotation				as Notation.MoveNotation-import qualified	BishBosh.Property.Null					as Property.Null-import qualified	BishBosh.Text.ShowList					as Text.ShowList-import qualified	BishBosh.Types						as T+import qualified	BishBosh.Component.Move				as Component.Move+import qualified	BishBosh.Component.Turn				as Component.Turn+import qualified	BishBosh.Data.Exception				as Data.Exception+import qualified	BishBosh.Evaluation.Fitness			as Evaluation.Fitness+import qualified	BishBosh.Input.EvaluationOptions		as Input.EvaluationOptions+import qualified	BishBosh.Metric.WeightedMeanAndCriterionValues	as Metric.WeightedMeanAndCriterionValues+import qualified	BishBosh.Model.Game				as Model.Game+import qualified	BishBosh.Notation.MoveNotation			as Notation.MoveNotation+import qualified	BishBosh.Property.Null				as Property.Null+import qualified	BishBosh.Text.ShowList				as Text.ShowList+import qualified	BishBosh.Type.Count				as Type.Count+import qualified	BishBosh.Type.Length				as Type.Length+import qualified	BishBosh.Type.Mass				as Type.Mass import qualified	Control.DeepSeq import qualified	Control.Exception import qualified	Data.Maybe@@ -75,80 +77,67 @@ #endif  -- | The selected /game/ & the criteria against which it was quantified.-data QuantifiedGame x y criterionValue weightedMean	= MkQuantifiedGame {+data QuantifiedGame x y	= MkQuantifiedGame { 	getGame					:: Model.Game.Game x y,	-- ^ The /game/ resulting from a sequence of /turn/s.-	getWeightedMeanAndCriterionValues	:: Attribute.WeightedMeanAndCriterionValues.WeightedMeanAndCriterionValues weightedMean criterionValue+	getWeightedMeanAndCriterionValues	:: Metric.WeightedMeanAndCriterionValues.WeightedMeanAndCriterionValues } deriving (Eq, Show) -instance Control.DeepSeq.NFData weightedMean => Control.DeepSeq.NFData (QuantifiedGame x y criterionValue weightedMean) where+instance Control.DeepSeq.NFData (QuantifiedGame x y) where 	rnf MkQuantifiedGame { getWeightedMeanAndCriterionValues = weightedMeanAndCriterionValues }	= Control.DeepSeq.rnf weightedMeanAndCriterionValues	-- The other field is a prerequisite. -instance (Enum x, Enum y, Real criterionValue, Real weightedMean) => Notation.MoveNotation.ShowNotationFloat (QuantifiedGame x y criterionValue weightedMean) where+instance (Enum x, Enum y) => Notation.MoveNotation.ShowNotationFloat (QuantifiedGame x y) where 	showsNotationFloat moveNotation showsDouble quantifiedGame	= Text.ShowList.showsAssociationList Text.ShowList.showsSeparator $ map ($ quantifiedGame) [ 		(,) Component.Move.tag . Notation.MoveNotation.showsNotation moveNotation . getLastTurn,-		(,) Attribute.WeightedMeanAndCriterionValues.weightedMeanTag . showsDouble . realToFrac . getFitness,-		(,) Attribute.WeightedMeanAndCriterionValues.criterionValuesTag . Text.ShowList.showsFormattedList' (showsDouble . realToFrac) . Attribute.WeightedMeanAndCriterionValues.getCriterionValues . getWeightedMeanAndCriterionValues+		(,) Metric.WeightedMeanAndCriterionValues.weightedMeanTag . showsDouble . realToFrac . getFitness,+		(,) Metric.WeightedMeanAndCriterionValues.criterionValuesTag . Text.ShowList.showsFormattedList' (showsDouble . realToFrac) . Metric.WeightedMeanAndCriterionValues.getCriterionValues . getWeightedMeanAndCriterionValues 	 ] -instance Property.Null.Null (QuantifiedGame x y criterionValue weightedMean) where+instance Property.Null.Null (QuantifiedGame x y) where 	isNull MkQuantifiedGame { getGame = game }	= Property.Null.isNull game  -- | Accessor.-getFitness :: QuantifiedGame x y criterionValue weightedMean -> weightedMean-getFitness MkQuantifiedGame { getWeightedMeanAndCriterionValues = weightedMeanAndCriterionValues }	= Attribute.WeightedMeanAndCriterionValues.getWeightedMean weightedMeanAndCriterionValues+getFitness :: QuantifiedGame x y -> Type.Mass.WeightedMean+getFitness MkQuantifiedGame { getWeightedMeanAndCriterionValues = weightedMeanAndCriterionValues }	= Metric.WeightedMeanAndCriterionValues.getWeightedMean weightedMeanAndCriterionValues --- | Like 'fromGame' except that the caller determines the piece-square value.+-- | Constructor. fromGame :: (-#ifdef USE_PARALLEL-	Control.DeepSeq.NFData					criterionValue,-#endif #ifdef USE_UNBOXED_ARRAYS 	Data.Array.Unboxed.IArray Data.Array.Unboxed.UArray	pieceSquareValue,	-- Requires 'FlexibleContexts'. The unboxed representation of the array-element must be defined (& therefore must be of fixed size). #endif 	Enum							x, 	Enum							y,-	Fractional						criterionValue, 	Fractional						pieceSquareValue,-	Fractional						rankValue,-	Fractional						weightedMean, 	Ord							x, 	Ord							y,-	Real							criterionValue,-	Real							criterionWeight, 	Real							pieceSquareValue,-	Real							rankValue, 	Show							x, 	Show							y  ) 	=> Maybe pieceSquareValue	-- ^ The value for the specified game. 	-> Model.Game.Game x y		-- ^ The current state of the /game/.-	-> Input.EvaluationOptions.Reader criterionWeight pieceSquareValue rankValue x y (QuantifiedGame x y criterionValue weightedMean)-{-# SPECIALISE fromGame :: Maybe T.PieceSquareValue -> Model.Game.Game T.X T.Y -> Input.EvaluationOptions.Reader T.CriterionWeight T.PieceSquareValue T.RankValue T.X T.Y (QuantifiedGame T.X T.Y T.CriterionValue T.WeightedMean) #-}+	-> Input.EvaluationOptions.Reader pieceSquareValue x y (QuantifiedGame x y)+{-# SPECIALISE fromGame :: Maybe Type.Mass.PieceSquareValue -> Model.Game.Game Type.Length.X Type.Length.Y -> Input.EvaluationOptions.Reader Type.Mass.PieceSquareValue Type.Length.X Type.Length.Y (QuantifiedGame Type.Length.X Type.Length.Y) #-} fromGame maybePieceSquareValue game	= MkQuantifiedGame game `fmap` Evaluation.Fitness.evaluateFitness maybePieceSquareValue game  -- | Retrieve the /turn/ used to generate the selected /game/.-getLastTurn :: QuantifiedGame x y criterionValue weightedMean -> Component.Turn.Turn x y+getLastTurn :: QuantifiedGame x y -> Component.Turn.Turn x y getLastTurn MkQuantifiedGame { getGame = game }	= Data.Maybe.fromMaybe ( 	Control.Exception.throw $ Data.Exception.mkResultUndefined "BishBosh.Evaluation.QuantifiedGame.getLastTurn:\tzero turns have been made."  ) $ Model.Game.maybeLastTurn game --- | Drop the specified number of old turns from the start of the chronological sequence, leaving the most recent.+-- | Drop the specified number of plies from the start of the chronological sequence, leaving the most recent. getLatestTurns-	:: Component.Move.NPlies-	-> QuantifiedGame x y criterionValue weightedMean+	:: Type.Count.NPlies	-- ^ The number of plies to drop from the start of the chronological sequence.+	-> QuantifiedGame x y 	-> [Component.Turn.Turn x y]-getLatestTurns nPlies MkQuantifiedGame { getGame = game }	= drop nPlies $ Model.Game.listTurnsChronologically game+getLatestTurns nPlies MkQuantifiedGame { getGame = game }	= fromIntegral nPlies `drop` Model.Game.listTurnsChronologically game  -- | Represent the /fitness/ of the /game/ resulting from a future /move/ by the opponent, from the perspective of the current player.-negateFitness :: Num weightedMean => QuantifiedGame x y criterionValue weightedMean -> QuantifiedGame x y criterionValue weightedMean-negateFitness quantifiedGame@MkQuantifiedGame { getWeightedMeanAndCriterionValues = weightedMeanAndCriterionValues }	= quantifiedGame { getWeightedMeanAndCriterionValues = Attribute.WeightedMeanAndCriterionValues.negateWeightedMean weightedMeanAndCriterionValues }+negateFitness :: QuantifiedGame x y -> QuantifiedGame x y+negateFitness quantifiedGame@MkQuantifiedGame { getWeightedMeanAndCriterionValues = weightedMeanAndCriterionValues }	= quantifiedGame { getWeightedMeanAndCriterionValues = Metric.WeightedMeanAndCriterionValues.negateWeightedMean weightedMeanAndCriterionValues }  -- | Compares fitness.-compareFitness-	:: Ord weightedMean-	=> QuantifiedGame x y criterionValue weightedMean-	-> QuantifiedGame x y criterionValue weightedMean-	-> Ordering+compareFitness :: QuantifiedGame x y -> QuantifiedGame x y -> Ordering compareFitness	= Data.Ord.comparing getFitness  {- |@@ -156,12 +145,13 @@  	* N.B.: 'Nothing' is interpreted as unbounded. -}-type OpenInterval x y criterionValue weightedMean	= (Maybe (QuantifiedGame x y criterionValue weightedMean), Maybe (QuantifiedGame x y criterionValue weightedMean))+type OpenInterval x y	= (Maybe (QuantifiedGame x y), Maybe (QuantifiedGame x y))  -- | Constant.-unboundedInterval :: OpenInterval x y criterionValue weightedMean+unboundedInterval :: OpenInterval x y unboundedInterval	= (Nothing, Nothing)  -- | Reflect the interval about zero.-negateInterval :: Num weightedMean => OpenInterval x y criterionValue weightedMean -> OpenInterval x y criterionValue weightedMean+negateInterval :: OpenInterval x y -> OpenInterval x y negateInterval (maybeAlpha, maybeBeta)	= ($ maybeBeta) &&& ($ maybeAlpha) $ fmap negateFitness+

@@ -81,8 +81,9 @@ ) where  import			BishBosh.Data.Bool()	-- For 'HXT.XmlPickler Bool'.-import qualified	BishBosh.Data.Foldable		as Data.Foldable+import			Control.Arrow((|||)) import qualified	BishBosh.Data.Exception		as Data.Exception+import qualified	BishBosh.Data.Foldable		as Data.Foldable import qualified	BishBosh.Text.ShowList		as Text.ShowList import qualified	Control.DeepSeq import qualified	Control.Exception@@ -329,7 +330,7 @@ 			\s -> case reads s of 				[(i, "")]	-> Left i 				_		-> Right s,-			\value -> showChar '"' $ either shows showString value "\""+			\value -> showChar '"' $ (shows ||| showString) value "\"" 		 ) ( 			HXT.xpAttr "value" HXT.xpText0 		 )@@ -338,17 +339,15 @@ 	 ) where 		def	= Data.Default.def --- | Smart-constructor.+-- | Smart constructor. mkCECPFeatures :: [Feature] -> Bool -> CECPFeatures mkCECPFeatures features done 	| Just (key, _)	<- Data.List.find ( 		not . all Data.Char.isAlpha . fst {-key-} 	) features	= Control.Exception.throw . Data.Exception.mkInvalidDatum . showString "BishBosh.Input.CECPFeatures.mkCECPFeatures:\tinvalid key" . Text.ShowList.showsAssociation $ shows key "." 	| Just (_, value)	<- Data.List.find (-		either (-			const False-		) (-			any (`elem` "\"\n\r")	-- Prevent command-injection.+		(+			const False ||| any (`elem` "\"\n\r") {-Prevent command-injection-} 		) . snd {-value-} 	) features	= Control.Exception.throw . Data.Exception.mkInvalidDatum . showString "BishBosh.Input.CECPFeatures.mkCECPFeatures:\tinvalid value" . Text.ShowList.showsAssociation $ shows value "." 	| not $ null duplicateFeatures	= Control.Exception.throw . Data.Exception.mkDuplicateData . showString "BishBosh.Input.CECPFeatures.mkCECPFeatures:\tduplicate features " $ shows duplicateFeatures "."@@ -380,11 +379,9 @@ 	getFeatures	= features } = cecpFeatures { 	getFeatures	= filter (-		either (-			const $ (/= key) . fst-		) (-			const (/= feature)	-- N.B.: string-valued features must also match the specified value, to account for possibility of duplicates.-		) value+		const (+			(/= key) . fst+		) ||| const (/= feature) {-N.B.: string-valued features must also match the specified value, to account for possibility of duplicates-} $ value 	) features } @@ -403,6 +400,6 @@ } = Data.Maybe.maybe ( 	Control.Exception.throw . Data.Exception.mkSearchFailure . showString "BishBosh.Input.CECPFeatures.isFeatureDisabled:\t" $ shows key " not found."  ) (-	(== 0) `either` null+	(== 0) ||| null  ) $ lookup key features 

@@ -62,17 +62,20 @@ 	setProtocolVersion, 	updateFeature, 	deleteFeature,-	resetModes+	resetModes,+	pause,+	resume ) where  import qualified	BishBosh.Data.Exception		as Data.Exception import qualified	BishBosh.Input.CECPFeatures	as Input.CECPFeatures+import qualified	BishBosh.Property.Switchable	as Property.Switchable import qualified	BishBosh.Text.ShowList		as Text.ShowList+import qualified	BishBosh.Time.StopWatch		as Time.StopWatch import qualified	Control.DeepSeq import qualified	Control.Exception import qualified	Data.Default import qualified	Data.Maybe-import qualified	Data.Time.Clock import qualified	Text.XML.HXT.Arrow.Pickle	as HXT  -- | Used to qualify XML.@@ -119,14 +122,14 @@  -- | Defines options related to CECP. data CECPOptions	= MkCECPOptions {-	getAnalyseMode		:: Mode,					-- ^ TODO.-	getDisplaySAN		:: Bool,					-- ^ Whether to display moves in SAN or 'Input.UIOptions.getMoveNotation'.-	getEditMode		:: Mode,					-- ^ Whether the game should be placed in set-up mode.-	getForceMode		:: Mode,					-- ^ Neither player's moves are automated, allowing an arbitrary game to be configured.-	getMaybePaused		:: Maybe Data.Time.Clock.NominalDiffTime,	-- ^ Whether the engine was paused after the specified time.-	getPonderMode		:: Mode,					-- ^ Whether to keep thinking while it's one's opponent's turn.-	getPostMode		:: Mode,					-- ^ Whether to show the details of deliberations.-	getProtocolVersion	:: ProtocolVersion,				-- ^ The version of the CECP-protocol to use.+	getAnalyseMode		:: Mode,				-- ^ TODO.+	getDisplaySAN		:: Bool,				-- ^ Whether to display moves in SAN or 'Input.UIOptions.getMoveNotation'.+	getEditMode		:: Mode,				-- ^ Whether the game should be placed in set-up mode.+	getForceMode		:: Mode,				-- ^ Neither player's moves are automated, allowing an arbitrary game to be configured.+	getMaybePaused		:: Maybe Time.StopWatch.StopWatch,	-- ^ Whether the engine was paused & a paused watch.+	getPonderMode		:: Mode,				-- ^ Whether to keep thinking while it's one's opponent's turn.+	getPostMode		:: Mode,				-- ^ Whether to show the details of deliberations.+	getProtocolVersion	:: ProtocolVersion,			-- ^ The version of the CECP-protocol to use. 	getCECPFeatures		:: Input.CECPFeatures.CECPFeatures } deriving Eq @@ -200,19 +203,18 @@  instance HXT.XmlPickler CECPOptions where 	xpickle	= HXT.xpElem tag . HXT.xpWrap (-		\(a, b, c, d, e, f, g, h, i) -> mkCECPOptions a b c d e f g h i,	-- Construct.+		\(a, b, c, d, e, f, g, h) -> mkCECPOptions a b c d (getMaybePaused def) e f g h,	-- Construct. 		\MkCECPOptions { 			getAnalyseMode		= analyseMode, 			getDisplaySAN		= displaySAN, 			getEditMode		= editMode, 			getForceMode		= forceMode,-			getMaybePaused		= maybePaused, 			getPonderMode		= ponderMode, 			getPostMode		= postMode, 			getProtocolVersion	= protocolVersion, 			getCECPFeatures		= cecpFeatures-		} -> (analyseMode, displaySAN, editMode, forceMode, maybePaused, ponderMode, postMode, protocolVersion, cecpFeatures) -- Deconstruct.-	 ) $ HXT.xp9Tuple (+		} -> (analyseMode, displaySAN, editMode, forceMode, ponderMode, postMode, protocolVersion, cecpFeatures) -- Deconstruct.+	 ) $ HXT.xp8Tuple ( 		getAnalyseMode def `HXT.xpDefault` HXT.xpAttr analyseModeTag HXT.xpickle 	 ) ( 		getDisplaySAN def `HXT.xpDefault` HXT.xpAttr displaySANTag HXT.xpickle@@ -221,8 +223,6 @@ 	 ) ( 		getForceMode def `HXT.xpDefault` HXT.xpAttr forceModeTag HXT.xpickle 	 ) (-		HXT.xpOption . HXT.xpWrap (toEnum, fromEnum) $ HXT.xpAttr pausedTag HXT.xpInt-	 ) ( 		getPonderMode def `HXT.xpDefault` HXT.xpAttr ponderModeTag HXT.xpickle 	 ) ( 		getPostMode def `HXT.xpDefault` HXT.xpAttr postModeTag HXT.xpickle@@ -233,23 +233,22 @@  -- | Smart constructor. mkCECPOptions-	:: Mode						-- ^ Analyse-mode.-	-> Bool						-- ^ Display SAN.-	-> Mode						-- ^ Edit-mode.-	-> Mode						-- ^ Force-mode.-	-> Maybe Data.Time.Clock.NominalDiffTime	-- ^ Paused.-	-> Mode						-- ^ Ponder-mode.-	-> Mode						-- ^ Post-mode.+	:: Mode					-- ^ Analyse-mode.+	-> Bool					-- ^ Display SAN.+	-> Mode					-- ^ Edit-mode.+	-> Mode					-- ^ Force-mode.+	-> Maybe Time.StopWatch.StopWatch	-- ^ Paused.+	-> Mode					-- ^ Ponder-mode.+	-> Mode					-- ^ Post-mode. 	-> ProtocolVersion 	-> Input.CECPFeatures.CECPFeatures 	-> CECPOptions mkCECPOptions analyseMode displaySAN editMode forceMode maybePaused ponderMode postMode protocolVersion cecpFeatures-	| protocolVersion < 1				= Control.Exception.throw . Data.Exception.mkOutOfBounds . showString "BishBosh.UI.CECPOptions.mkCECPOptions:\t" $ shows protocolVersionTag " must exceed zero."-	| Data.Maybe.maybe False (< 0) maybePaused	= Control.Exception.throw . Data.Exception.mkOutOfBounds . showString "BishBosh.UI.CECPOptions.mkCECPOptions:\t" $ shows pausedTag "; time already taken can't be negative."-	| otherwise					= MkCECPOptions {+	| protocolVersion < 1	= Control.Exception.throw . Data.Exception.mkOutOfBounds . showString "BishBosh.UI.CECPOptions.mkCECPOptions:\t" $ shows protocolVersionTag " must exceed zero."+	| otherwise		= MkCECPOptions { 		getAnalyseMode		= analyseMode,-		getEditMode		= editMode, 		getDisplaySAN		= displaySAN,+		getEditMode		= editMode, 		getForceMode		= forceMode, 		getMaybePaused		= maybePaused, 		getPonderMode		= ponderMode,@@ -322,4 +321,16 @@ 		postMode 	)  ]++-- | Mutator.+pause :: Time.StopWatch.StopWatch -> CECPOptions -> CECPOptions+pause _ MkCECPOptions { getMaybePaused = Just _ }	= Control.Exception.throw $ Data.Exception.mkRequestFailure "BishBosh.Input.CECPOptions.pause:\talready paused."+pause stopWatch cecpOptions+	| Property.Switchable.isOn stopWatch	= Control.Exception.throw $ Data.Exception.mkRequestFailure "BishBosh.Input.CECPOptions.pause:\tthe stop-watch is still running."+	| otherwise				= cecpOptions { getMaybePaused = Just stopWatch }++-- | Mutator.+resume :: CECPOptions -> CECPOptions+resume MkCECPOptions { getMaybePaused = Nothing }	= Control.Exception.throw $ Data.Exception.mkRequestFailure "BishBosh.Input.CECPOptions.resume:\talready resumed."+resume cecpOptions					= cecpOptions { getMaybePaused = Nothing } 

@@ -103,3 +103,4 @@ -- | Mutator. prependOptionsMutator :: OptionsMutator options -> Transformation options prependOptionsMutator optionsMutator categorisedCommandLineOptions	= categorisedCommandLineOptions { getOptionsMutators = optionsMutator : getOptionsMutators categorisedCommandLineOptions }+

@@ -1,4 +1,3 @@-{-# LANGUAGE CPP #-} {- 	Copyright (C) 2018 Dr. Alistair Ward @@ -53,60 +52,60 @@ -- * Functions 	calculateWeightedMean, 	normalise,-	perturbWeights,+--	perturbWeights, -- ** Constructor 	mkCriteriaWeights ) where -import qualified	BishBosh.Attribute.CriterionValue			as Attribute.CriterionValue-import qualified	BishBosh.Attribute.CriterionWeight			as Attribute.CriterionWeight-import qualified	BishBosh.Attribute.WeightedMeanAndCriterionValues	as Attribute.WeightedMeanAndCriterionValues-import qualified	BishBosh.Data.Exception					as Data.Exception-import qualified	BishBosh.Property.ShowFloat				as Property.ShowFloat-import qualified	BishBosh.Text.ShowList					as Text.ShowList-import qualified	BishBosh.Types						as T+import qualified	BishBosh.Data.Exception				as Data.Exception+import qualified	BishBosh.Metric.CriterionValue			as Metric.CriterionValue+import qualified	BishBosh.Metric.CriterionWeight			as Metric.CriterionWeight+import qualified	BishBosh.Metric.WeightedMeanAndCriterionValues	as Metric.WeightedMeanAndCriterionValues+import qualified	BishBosh.Property.ShowFloat			as Property.ShowFloat+import qualified	BishBosh.Text.ShowList				as Text.ShowList+import qualified	BishBosh.Type.Mass				as Type.Mass import qualified	Control.Arrow import qualified	Control.DeepSeq import qualified	Control.Exception import qualified	Data.Default import qualified	System.Random-import qualified	Text.XML.HXT.Arrow.Pickle				as HXT+import qualified	Text.XML.HXT.Arrow.Pickle			as HXT  -- | Used to qualify the XML. tag :: String-tag					= "criteriaWeights"+tag				= "criteriaWeights"  -- | Used to qualify the XML. weightOfMaterialTag :: String-weightOfMaterialTag			= "material"+weightOfMaterialTag		= "material"  -- | Used to qualify the XML. weightOfMobilityTag :: String-weightOfMobilityTag			= "mobility"+weightOfMobilityTag		= "mobility"  -- | Used to qualify the XML. weightOfPieceSquareValueTag :: String-weightOfPieceSquareValueTag		= "pieceSquareValue"+weightOfPieceSquareValueTag	= "pieceSquareValue"  -- | Used to qualify the XML. weightOfCastlingPotentialTag :: String-weightOfCastlingPotentialTag		= "castlingPotential"+weightOfCastlingPotentialTag	= "castlingPotential"  -- | Used to qualify the XML. weightOfDefenceTag :: String-weightOfDefenceTag			= "defence"+weightOfDefenceTag		= "defence"  -- | Used to qualify the XML. weightOfDoubledPawnsTag :: String-weightOfDoubledPawnsTag			= "doubledPawns"+weightOfDoubledPawnsTag		= "doubledPawns"  -- | Used to qualify the XML. weightOfIsolatedPawnsTag :: String-weightOfIsolatedPawnsTag		= "isolatedPawns"+weightOfIsolatedPawnsTag	= "isolatedPawns"  -- | Used to qualify the XML. weightOfPassedPawnsTag :: String-weightOfPassedPawnsTag			= "passedPawns"+weightOfPassedPawnsTag		= "passedPawns"  {- | 	* The weight of various criteria used to select a /move/ from alternatives, at a specific point in the game.@@ -114,36 +113,35 @@ 	* CAVEAT: these weights determine the effective value of /isolated/ or /doubled/ @Pawn@s, 	& this value shouldn't be less than their weighted normalised /rank-value/, otherwise sacrifice would be beneficial. -}-data CriteriaWeights criterionWeight	= MkCriteriaWeights {-	getWeightOfMaterial		:: Attribute.CriterionWeight.CriterionWeight criterionWeight,	-- ^ The arithmetic difference between the total /rank-value/ of the /piece/s currently in play on either side; <https://www.chessprogramming.org/Material>.-	getWeightOfMobility		:: Attribute.CriterionWeight.CriterionWeight criterionWeight,	-- ^ The arithmetic difference between the reciprocal of the number of destinations available to the /piece/s of either side. N.B. this weight can be derived from 'getWeightOfMaterial' since losing a @Queen@ is less significant than reducing mobility to zero; <https://www.chessprogramming.org/Mobility>.-	getWeightOfPieceSquareValue	:: Attribute.CriterionWeight.CriterionWeight criterionWeight,	-- ^ The arithmetic difference in the values of the squares occupied by the pieces of either side.-	getWeightOfCastlingPotential	:: Attribute.CriterionWeight.CriterionWeight criterionWeight,	-- ^ Whether each player has been permanently prevented from /Castling/.-	getWeightOfDefence		:: Attribute.CriterionWeight.CriterionWeight criterionWeight,	-- ^ The arithmetic difference between the number of /piece/s defending each of one's own, compared with the opponent.-	getWeightOfDoubledPawns		:: Attribute.CriterionWeight.CriterionWeight criterionWeight,	-- ^ The arithmetic difference between the total number of /doubled/ @Pawn@s on either side; <https://www.chessprogramming.org/Doubled_Pawn>.-	getWeightOfIsolatedPawns	:: Attribute.CriterionWeight.CriterionWeight criterionWeight,	-- ^ The arithmetic difference between the total number of /isolated/ @Pawn@s on either side; <https://www.chessprogramming.org/Isolated_Pawn>.-	getWeightOfPassedPawns		:: Attribute.CriterionWeight.CriterionWeight criterionWeight	-- ^ The arithmetic difference between the total number of /passed/ @Pawn@s on either side; <https://www.chessprogramming.org/Passed_Pawn>.+data CriteriaWeights	= MkCriteriaWeights {+	getWeightOfMaterial		:: Metric.CriterionWeight.CriterionWeight,	-- ^ The arithmetic difference between the total /rank-value/ of the /piece/s currently in play on either side; <https://www.chessprogramming.org/Material>.+	getWeightOfMobility		:: Metric.CriterionWeight.CriterionWeight,	-- ^ The arithmetic difference between the reciprocal of the number of destinations available to the /piece/s of either side. N.B. this weight can be derived from 'getWeightOfMaterial' since losing a @Queen@ is less significant than reducing mobility to zero; <https://www.chessprogramming.org/Mobility>.+	getWeightOfPieceSquareValue	:: Metric.CriterionWeight.CriterionWeight,	-- ^ The arithmetic difference in the values of the squares occupied by the pieces of either side.+	getWeightOfCastlingPotential	:: Metric.CriterionWeight.CriterionWeight,	-- ^ Whether each player has been permanently prevented from /Castling/.+	getWeightOfDefence		:: Metric.CriterionWeight.CriterionWeight,	-- ^ The arithmetic difference between the number of /piece/s defending each of one's own, compared with the opponent.+	getWeightOfDoubledPawns		:: Metric.CriterionWeight.CriterionWeight,	-- ^ The arithmetic difference between the total number of /doubled/ @Pawn@s on either side; <https://www.chessprogramming.org/Doubled_Pawn>.+	getWeightOfIsolatedPawns	:: Metric.CriterionWeight.CriterionWeight,	-- ^ The arithmetic difference between the total number of /isolated/ @Pawn@s on either side; <https://www.chessprogramming.org/Isolated_Pawn>.+	getWeightOfPassedPawns		:: Metric.CriterionWeight.CriterionWeight	-- ^ The arithmetic difference between the total number of /passed/ @Pawn@s on either side; <https://www.chessprogramming.org/Passed_Pawn>. } deriving (Eq, Show) --- | Smart-constructor.+-- | Smart constructor. mkCriteriaWeights-	:: (Eq criterionWeight, Num criterionWeight)-	=> Attribute.CriterionWeight.CriterionWeight criterionWeight	-- ^ /material/.-	-> Attribute.CriterionWeight.CriterionWeight criterionWeight	-- ^ /mobility/.-	-> Attribute.CriterionWeight.CriterionWeight criterionWeight	-- ^ /pieceSquareValue/.-	-> Attribute.CriterionWeight.CriterionWeight criterionWeight	-- ^ /castlingPotential/.-	-> Attribute.CriterionWeight.CriterionWeight criterionWeight	-- ^ /defence/.-	-> Attribute.CriterionWeight.CriterionWeight criterionWeight	-- ^ /doubledPawns/.-	-> Attribute.CriterionWeight.CriterionWeight criterionWeight	-- ^ /isolatedPawns/.-	-> Attribute.CriterionWeight.CriterionWeight criterionWeight	-- ^ /passedPawns/.-	-> CriteriaWeights criterionWeight+	:: Metric.CriterionWeight.CriterionWeight	-- ^ /material/.+	-> Metric.CriterionWeight.CriterionWeight	-- ^ /mobility/.+	-> Metric.CriterionWeight.CriterionWeight	-- ^ /pieceSquareValue/.+	-> Metric.CriterionWeight.CriterionWeight	-- ^ /castlingPotential/.+	-> Metric.CriterionWeight.CriterionWeight	-- ^ /defence/.+	-> Metric.CriterionWeight.CriterionWeight	-- ^ /doubledPawns/.+	-> Metric.CriterionWeight.CriterionWeight	-- ^ /isolatedPawns/.+	-> Metric.CriterionWeight.CriterionWeight	-- ^ /passedPawns/.+	-> CriteriaWeights mkCriteriaWeights a b c d e f g h 	| criteriaWeights == minBound	= Control.Exception.throw $ Data.Exception.mkInvalidDatum "BishBosh.Input.CriteriaWeights.mkCriteriaWeights:\tall weights are zero." 	| otherwise			= criteriaWeights 	where 		criteriaWeights	= MkCriteriaWeights a b c d e f g h -instance Real criterionWeight => Property.ShowFloat.ShowFloat (CriteriaWeights criterionWeight) where+instance Property.ShowFloat.ShowFloat CriteriaWeights where 	showsFloat fromDouble MkCriteriaWeights { 		getWeightOfMaterial		= weightOfMaterial, 		getWeightOfMobility		= weightOfMobility,@@ -154,7 +152,7 @@ 		getWeightOfIsolatedPawns	= weightOfIsolatedPawns, 		getWeightOfPassedPawns		= weightOfPassedPawns 	} = Text.ShowList.showsAssociationList' $ map (-		Control.Arrow.second $ fromDouble . realToFrac . Attribute.CriterionWeight.deconstruct+		Control.Arrow.second $ fromDouble . realToFrac 	 ) [ 		( 			weightOfMaterialTag,		weightOfMaterial@@ -175,7 +173,7 @@ 		) 	 ] -instance Num criterionWeight => Data.Default.Default (CriteriaWeights criterionWeight) where+instance Data.Default.Default CriteriaWeights where 	def = MkCriteriaWeights { 		getWeightOfMaterial		= maxBound, 		getWeightOfMobility		= Data.Default.def,@@ -187,19 +185,14 @@ 		getWeightOfPassedPawns		= Data.Default.def 	} -instance Control.DeepSeq.NFData criterionWeight => Control.DeepSeq.NFData (CriteriaWeights criterionWeight) where+instance Control.DeepSeq.NFData CriteriaWeights where 	rnf (MkCriteriaWeights a b c d e f g h)	= Control.DeepSeq.rnf [a, b, c, d, e, f, g, h] -instance Num criterionWeight => Bounded (CriteriaWeights criterionWeight) where+instance Bounded CriteriaWeights where 	maxBound	= MkCriteriaWeights maxBound maxBound maxBound maxBound maxBound maxBound maxBound maxBound 	minBound	= MkCriteriaWeights minBound minBound minBound minBound minBound minBound minBound minBound -instance (-	HXT.XmlPickler	criterionWeight,-	Num		criterionWeight,-	Ord		criterionWeight,-	Show		criterionWeight- ) => HXT.XmlPickler (CriteriaWeights criterionWeight) where+instance HXT.XmlPickler CriteriaWeights where 	xpickle	= HXT.xpDefault Data.Default.def . HXT.xpElem tag $ HXT.xpWrap ( 		\(a, b, c, d, e, f, g, h) -> mkCriteriaWeights a b c d e f g h,	-- Construct. 		\MkCriteriaWeights {@@ -249,36 +242,17 @@  	* Also writes individual unweighted /criterion-value/s, to facilitate post-analysis; if the corresponding weight is zero, for efficiency evaluation of the criterion is avoided. -}-calculateWeightedMean :: (-#ifdef USE_PARALLEL-	Control.DeepSeq.NFData	criterionValue,-#endif-	Fractional		weightedMean,-	Real			criterionValue,-	Real			criterionWeight- )-	=> CriteriaWeights criterionWeight-	-> Attribute.CriterionValue.CriterionValue criterionValue						-- ^ /material/:	maximum if a player's /move/ equals the maximum total piece value (including /queened/ @Pawn@s), while their opponent has just a @King@.-	-> Attribute.CriterionValue.CriterionValue criterionValue						-- ^ /mobility/:	maximum when the opponent is check-mated.-	-> Attribute.CriterionValue.CriterionValue criterionValue						-- ^ /pieceSquareValue/:	maximum when this player occupies all the strategically important squares & the opponent none.-	-> Attribute.CriterionValue.CriterionValue criterionValue						-- ^ /castlingPotential/:	maximum when this player either has /castled/ or can, but the opponent has been permanently prevented.-	-> Attribute.CriterionValue.CriterionValue criterionValue						-- ^ /defence/:	maximum when this player's /piece/s are fully utilised in defence, but none of the opponent's are.-	-> Attribute.CriterionValue.CriterionValue criterionValue						-- ^ /doubledPawns/:	maximum when this player hasn't any /doubled/ @Pawn@s & the opponent has two files of four @Pawn@s.-	-> Attribute.CriterionValue.CriterionValue criterionValue						-- ^ /isolatedPawns/:	maximum when this player hasn't any /isolated/ @Pawn@s & all the opponent's @Pawn@s are /isolated/.-	-> Attribute.CriterionValue.CriterionValue criterionValue						-- ^ /passedPawns/:	maximum when this player has 8 /passed/ @Pawn@s & the opponent has none.-	-> Attribute.WeightedMeanAndCriterionValues.WeightedMeanAndCriterionValues weightedMean criterionValue	-- ^ The individual /criteria/ values, & their /weighted mean/.-{-# SPECIALISE calculateWeightedMean-	:: CriteriaWeights T.CriterionWeight-	-> Attribute.CriterionValue.CriterionValue T.CriterionValue-	-> Attribute.CriterionValue.CriterionValue T.CriterionValue-	-> Attribute.CriterionValue.CriterionValue T.CriterionValue-	-> Attribute.CriterionValue.CriterionValue T.CriterionValue-	-> Attribute.CriterionValue.CriterionValue T.CriterionValue-	-> Attribute.CriterionValue.CriterionValue T.CriterionValue-	-> Attribute.CriterionValue.CriterionValue T.CriterionValue-	-> Attribute.CriterionValue.CriterionValue T.CriterionValue-	-> Attribute.WeightedMeanAndCriterionValues.WeightedMeanAndCriterionValues T.WeightedMean T.CriterionValue- #-}+calculateWeightedMean+	:: CriteriaWeights+	-> Metric.CriterionValue.CriterionValue					-- ^ /material/:	maximum if a player's /move/ equals the maximum total piece value (including /queened/ @Pawn@s), while their opponent has just a @King@.+	-> Metric.CriterionValue.CriterionValue					-- ^ /mobility/:	maximum when the opponent is check-mated.+	-> Metric.CriterionValue.CriterionValue					-- ^ /pieceSquareValue/:	maximum when this player occupies all the strategically important squares & the opponent none.+	-> Metric.CriterionValue.CriterionValue					-- ^ /castlingPotential/:	maximum when this player either has /castled/ or can, but the opponent has been permanently prevented.+	-> Metric.CriterionValue.CriterionValue					-- ^ /defence/:	maximum when this player's /piece/s are fully utilised in defence, but none of the opponent's are.+	-> Metric.CriterionValue.CriterionValue					-- ^ /doubledPawns/:	maximum when this player hasn't any /doubled/ @Pawn@s & the opponent has two files of four @Pawn@s.+	-> Metric.CriterionValue.CriterionValue					-- ^ /isolatedPawns/:	maximum when this player hasn't any /isolated/ @Pawn@s & all the opponent's @Pawn@s are /isolated/.+	-> Metric.CriterionValue.CriterionValue					-- ^ /passedPawns/:	maximum when this player has 8 /passed/ @Pawn@s & the opponent has none.+	-> Metric.WeightedMeanAndCriterionValues.WeightedMeanAndCriterionValues	-- ^ The individual /criteria/ values, & their /weighted mean/. calculateWeightedMean MkCriteriaWeights { 	getWeightOfMaterial		= weightOfMaterial, 	getWeightOfMobility		= weightOfMobility,@@ -288,7 +262,7 @@ 	getWeightOfDoubledPawns		= weightOfDoubledPawns, 	getWeightOfIsolatedPawns	= weightOfIsolatedPawns, 	getWeightOfPassedPawns		= weightOfPassedPawns-} material mobility pieceSquareValue castlingPotential defence doubledPawns isolatedPawns passedPawns	= Attribute.CriterionValue.calculateWeightedMean [+} material mobility pieceSquareValue castlingPotential defence doubledPawns isolatedPawns passedPawns	= Metric.WeightedMeanAndCriterionValues.calculateWeightedMean [ 	( 		material,		weightOfMaterial 	), (@@ -309,14 +283,10 @@  ]  -- | The type of a function which mutates 'CriteriaWeights'.-type Transformation criterionWeight	= CriteriaWeights criterionWeight -> CriteriaWeights criterionWeight+type Transformation	= CriteriaWeights -> CriteriaWeights  -- | Adjust the mean weight, so that the maximum weight is @1@.-normalise :: (-	Fractional	criterionWeight,-	Ord		criterionWeight,-	Show		criterionWeight- ) => Transformation criterionWeight+normalise :: Transformation normalise criteriaWeights@MkCriteriaWeights { 	getWeightOfMaterial		= weightOfMaterial, 	getWeightOfMobility		= weightOfMobility,@@ -338,35 +308,29 @@ 	getWeightOfIsolatedPawns	= normaliseCriterionWeight weightOfIsolatedPawns, 	getWeightOfPassedPawns		= normaliseCriterionWeight weightOfPassedPawns  } where-	normaliseCriterionWeight	= Attribute.CriterionWeight.mkCriterionWeight . (-		/ Attribute.CriterionWeight.deconstruct (-			maximum [-				weightOfMaterial,-				weightOfMobility,-				weightOfPieceSquareValue,-				weightOfCastlingPotential,-				weightOfDefence,-				weightOfDoubledPawns,-				weightOfIsolatedPawns,-				weightOfPassedPawns-			]-		)-	 ) . Attribute.CriterionWeight.deconstruct+	normaliseCriterionWeight	= (+		/ maximum [+			weightOfMaterial,+			weightOfMobility,+			weightOfPieceSquareValue,+			weightOfCastlingPotential,+			weightOfDefence,+			weightOfDoubledPawns,+			weightOfIsolatedPawns,+			weightOfPassedPawns+		]+	 ) -- Section.  {- | 	* Independently perturbs each /criterion-weight/ by a random value, of configurable magnitude.  	* Under this transformation, /criterion-weight/s of @0@, will remain unchanged, thus irrelevant criteria remain irrelevant. -}-perturbWeights :: (-	Fractional		criterionWeight,-	Real			criterionWeight,-	Show			criterionWeight,-	System.Random.RandomGen	randomGen- )+perturbWeights+	:: System.Random.RandomGen randomGen 	=> randomGen-	-> criterionWeight	-- ^ Change-magnitude.-	-> Transformation criterionWeight+	-> Type.Mass.CriterionWeight	-- ^ Change-magnitude.+	-> Transformation perturbWeights _ 0 criteriaWeights	= criteriaWeights perturbWeights randomGen changeMagnitude MkCriteriaWeights { 	getWeightOfMaterial		= weightOfMaterial,@@ -387,15 +351,15 @@ 	getWeightOfIsolatedPawns	= reduceBy g weightOfIsolatedPawns, 	getWeightOfPassedPawns		= reduceBy h weightOfPassedPawns } where-	(a : b : c : d : e : f : g : h : _)	= System.Random.randomRs (1 :: Double, succ $ realToFrac changeMagnitude) randomGen-	reduceBy randomValue			= Attribute.CriterionWeight.mkCriterionWeight . (/ realToFrac randomValue) . Attribute.CriterionWeight.deconstruct	-- N.B. this always reduces the weight, leaving 'normalise' to correct this.+	(a : b : c : d : e : f : g : h : _)	= System.Random.randomRs (1, succ changeMagnitude) randomGen+	reduceBy randomValue			= (/ realToFrac randomValue)	-- N.B. this always reduces the weight, leaving 'normalise' to correct this.  -- | A constant list of named accessors & mutators. onymousOperators :: [ 	(-		String,												-- Tag.-		CriteriaWeights criterionWeight -> Attribute.CriterionWeight.CriterionWeight criterionWeight,	-- Accessor.-		Attribute.CriterionWeight.CriterionWeight criterionWeight -> Transformation criterionWeight	-- Mutator.+		String,								-- Tag.+		CriteriaWeights -> Metric.CriterionWeight.CriterionWeight,	-- Accessor.+		Metric.CriterionWeight.CriterionWeight -> Transformation	-- Mutator. 	) -- Triple.  ] onymousOperators	= [

@@ -38,6 +38,7 @@ 	EvaluationOptions( --		MkEvaluationOptions, 		getRankValues,+		getMaximumTotalRankValue, 		getCriteriaWeights, 		getIncrementalEvaluation, --		getMaybePieceSquareTablePair,@@ -56,14 +57,15 @@  import			BishBosh.Data.Bool() import			Control.Arrow((***))-import qualified	BishBosh.Attribute.RankValues				as Attribute.RankValues import qualified	BishBosh.Cartesian.Coordinates				as Cartesian.Coordinates import qualified	BishBosh.Component.PieceSquareByCoordinatesByRank	as Component.PieceSquareByCoordinatesByRank import qualified	BishBosh.Data.Exception					as Data.Exception import qualified	BishBosh.Input.CriteriaWeights				as Input.CriteriaWeights import qualified	BishBosh.Input.PieceSquareTable				as Input.PieceSquareTable+import qualified	BishBosh.Input.RankValues				as Input.RankValues import qualified	BishBosh.Property.ShowFloat				as Property.ShowFloat import qualified	BishBosh.Text.ShowList					as Text.ShowList+import qualified	BishBosh.Type.Mass					as Type.Mass import qualified	Control.DeepSeq import qualified	Control.Exception import qualified	Control.Monad.Reader@@ -96,54 +98,53 @@ type PieceSquareTablePair x y pieceSquareValue	= (Input.PieceSquareTable.PieceSquareTable x y pieceSquareValue, Input.PieceSquareTable.PieceSquareTable x y pieceSquareValue)  -- | Defines the options related to the automatic selection of /move/s.-data EvaluationOptions criterionWeight pieceSquareValue rankValue x y	= MkEvaluationOptions {-	getRankValues				:: Attribute.RankValues.RankValues rankValue,			-- ^ The static value associated with each /piece/'s /rank/.-	getCriteriaWeights			:: Input.CriteriaWeights.CriteriaWeights criterionWeight,	-- ^ The weights applied to each of the heterogeneous criterion-values used to select a /move/.-	getIncrementalEvaluation		:: IncrementalEvaluation,					-- ^ Whether to generate position-hashes & evaluate the piece-square value, from the previous value or from scratch.-	getMaybePieceSquareTablePair		:: Maybe (PieceSquareTablePair x y pieceSquareValue),		-- ^ A optional pair of piece-square tables representing the opening & end-games respectively.+data EvaluationOptions pieceSquareValue x y	= MkEvaluationOptions {+	getRankValues				:: Input.RankValues.RankValues,				-- ^ The static value associated with each /piece/'s /rank/.+	getMaximumTotalRankValue		:: Type.Mass.RankValue,					-- ^ Used to normalise the total value of pieces. Derived from 'getRankValues'.+	getCriteriaWeights			:: Input.CriteriaWeights.CriteriaWeights,		-- ^ The weights applied to each of the heterogeneous criterion-values used to select a /move/.+	getIncrementalEvaluation		:: IncrementalEvaluation,				-- ^ Whether to generate position-hashes & evaluate the piece-square value, from the previous value or from scratch.+	getMaybePieceSquareTablePair		:: Maybe (PieceSquareTablePair x y pieceSquareValue),	-- ^ A optional pair of piece-square tables representing the opening & end-games respectively. 	getMaybePieceSquareByCoordinatesByRank	:: Maybe ( 		Component.PieceSquareByCoordinatesByRank.PieceSquareByCoordinatesByRank x y pieceSquareValue-	)													-- ^ The optional value for each rank of /piece/, when occupying each coordinate, at each phase of the game.+	)												-- ^ The optional value for each rank of /piece/, when occupying each coordinate, at each phase of the game. } deriving (Eq, Show)  instance (-	Control.DeepSeq.NFData	criterionWeight, 	Control.DeepSeq.NFData	pieceSquareValue,-	Control.DeepSeq.NFData	rankValue, 	Control.DeepSeq.NFData	x, 	Control.DeepSeq.NFData	y- ) => Control.DeepSeq.NFData (EvaluationOptions criterionWeight pieceSquareValue rankValue x y) where+ ) => Control.DeepSeq.NFData (EvaluationOptions pieceSquareValue x y) where 	rnf MkEvaluationOptions {-		getRankValues				= rankValues,+--		getRankValues				= rankValues,+		getMaximumTotalRankValue		= maximumTotalValue, 		getCriteriaWeights			= criteriaWeights, 		getIncrementalEvaluation		= incrementalEvaluation, --		getMaybePieceSquareTablePair		= maybePieceSquareTablePair, 		getMaybePieceSquareByCoordinatesByRank	= maybePieceSquareByCoordinatesByRank-	} = Control.DeepSeq.rnf (rankValues, criteriaWeights, incrementalEvaluation, maybePieceSquareByCoordinatesByRank)+	} = Control.DeepSeq.rnf (maximumTotalValue, criteriaWeights, incrementalEvaluation, maybePieceSquareByCoordinatesByRank)  instance ( 	Enum	x, 	Enum	y, 	Ord	x, 	Ord	y,-	Real	criterionWeight, 	Real	pieceSquareValue,-	Real	rankValue, 	Show	pieceSquareValue- ) => Property.ShowFloat.ShowFloat (EvaluationOptions criterionWeight pieceSquareValue rankValue x y) where+ ) => Property.ShowFloat.ShowFloat (EvaluationOptions pieceSquareValue x y) where 	showsFloat fromDouble MkEvaluationOptions { 		getRankValues				= rankValues,+--		getMaximumTotalRankValue		= maximumTotalValue, 		getCriteriaWeights			= criteriaWeights, 		getIncrementalEvaluation		= incrementalEvaluation, 		getMaybePieceSquareTablePair		= maybePieceSquareTablePair --		getMaybePieceSquareByCoordinatesByRank	= maybePieceSquareByCoordinatesByRank 	} = Text.ShowList.showsAssociationList' $ [ 		(-			Attribute.RankValues.tag,		Property.ShowFloat.showsFloat fromDouble rankValues+			Input.RankValues.tag,		Property.ShowFloat.showsFloat fromDouble rankValues 		), ( 			incrementalEvaluationTag,	shows incrementalEvaluation 		), (-			Input.CriteriaWeights.tag,		Property.ShowFloat.showsFloat fromDouble criteriaWeights+			Input.CriteriaWeights.tag,	Property.ShowFloat.showsFloat fromDouble criteriaWeights 		) 	 ] ++ Data.Maybe.maybe [] ( 		\(t, t')	-> [@@ -157,42 +158,32 @@ 		] 	 ) maybePieceSquareTablePair -instance (-	Fractional	rankValue,-	Num		criterionWeight,-	Ord		rankValue,-	Show		rankValue- ) => Data.Default.Default (EvaluationOptions criterionWeight pieceSquareValue rankValue x y) where+instance Data.Default.Default (EvaluationOptions pieceSquareValue x y) where 	def = MkEvaluationOptions {-		getRankValues				= Data.Default.def,+		getRankValues				= rankValues,+		getMaximumTotalRankValue		= Input.RankValues.calculateMaximumTotalValue rankValues, 		getCriteriaWeights			= Data.Default.def, 		getIncrementalEvaluation		= True, 		getMaybePieceSquareTablePair		= Nothing, 		getMaybePieceSquareByCoordinatesByRank	= Nothing-	}+	} where+		rankValues	= Data.Default.def  instance ( 	Enum		x, 	Enum		y, 	Fractional	pieceSquareValue,-	Fractional	rankValue,-	HXT.XmlPickler	criterionWeight,-	HXT.XmlPickler	rankValue,-	Num		criterionWeight,-	Ord		criterionWeight, 	Ord		pieceSquareValue,-	Ord		rankValue, 	Ord		x, 	Ord		y, 	Real		pieceSquareValue,-	Show		pieceSquareValue,-	Show		criterionWeight,-	Show		rankValue- ) => HXT.XmlPickler (EvaluationOptions criterionWeight pieceSquareValue rankValue x y) where+	Show		pieceSquareValue+ ) => HXT.XmlPickler (EvaluationOptions pieceSquareValue x y) where 	xpickle	= HXT.xpDefault def . HXT.xpElem tag . HXT.xpWrap ( 		\(a, b, c, d) -> mkEvaluationOptions a b c d,	-- Construct. 		\MkEvaluationOptions { 			getRankValues				= rankValues,+--			getMaximumTotalRankValue		= maximumTotalRankValue, 			getCriteriaWeights			= criteriaWeights, 			getIncrementalEvaluation		= incrementalEvaluation, 			getMaybePieceSquareTablePair		= maybePieceSquareTablePair@@ -232,17 +223,15 @@ mkEvaluationOptions :: ( 	Enum		x, 	Enum		y,-	Eq		criterionWeight, 	Fractional	pieceSquareValue,-	Num		criterionWeight, 	Ord		x, 	Ord		y  )-	=> Attribute.RankValues.RankValues rankValue			-- ^ The static value associated with each /piece/'s /rank/.-	-> Input.CriteriaWeights.CriteriaWeights criterionWeight	-- ^ The weights applied to the values of the criteria used to select a /move/.+	=> Input.RankValues.RankValues				-- ^ The static value associated with each /piece/'s /rank/.+	-> Input.CriteriaWeights.CriteriaWeights		-- ^ The weights applied to the values of the criteria used to select a /move/. 	-> IncrementalEvaluation-	-> Maybe (PieceSquareTablePair x y pieceSquareValue)		-- ^ The value to each type of piece, of each square, during normal play & the end-game.-	-> EvaluationOptions criterionWeight pieceSquareValue rankValue x y+	-> Maybe (PieceSquareTablePair x y pieceSquareValue)	-- ^ The value to each type of piece, of each square, during normal play & the end-game.+	-> EvaluationOptions pieceSquareValue x y mkEvaluationOptions rankValues criteriaWeights incrementalEvaluation maybePieceSquareTablePair 	| Just (pieceSquareTable, _)	<- maybePieceSquareTablePair 	, let undefinedRanks	= Input.PieceSquareTable.findUndefinedRanks pieceSquareTable@@ -253,6 +242,7 @@ 	= Control.Exception.throw . Data.Exception.mkIncompatibleData . showString "BishBosh.Input.EvaluationOptions.mkEvaluationOptions:\tweight of " . shows Input.CriteriaWeights.weightOfPieceSquareValueTag . showString " is defined but " $ shows Input.PieceSquareTable.tag " isn't." 	| otherwise		= MkEvaluationOptions { 		getRankValues				= rankValues,+		getMaximumTotalRankValue		= Input.RankValues.calculateMaximumTotalValue rankValues,	-- Infer. 		getCriteriaWeights			= criteriaWeights, 		getIncrementalEvaluation		= incrementalEvaluation, 		getMaybePieceSquareTablePair		= maybePieceSquareTablePair,@@ -260,5 +250,5 @@ 	}  -- | Self-documentation.-type Reader criterionWeight pieceSquareValue rankValue x y	= Control.Monad.Reader.Reader (EvaluationOptions criterionWeight pieceSquareValue rankValue x y)+type Reader pieceSquareValue x y	= Control.Monad.Reader.Reader (EvaluationOptions pieceSquareValue x y) 

@@ -26,7 +26,6 @@ -- * Types -- ** Type-synonyms --	Transformation,-	MaximumPGNNames, -- ** Data-types 	IOOptions( --		MkIOOptions,@@ -63,6 +62,7 @@ import qualified	BishBosh.Input.Verbosity	as Input.Verbosity import qualified	BishBosh.Property.Arboreal	as Property.Arboreal import qualified	BishBosh.Text.ShowList		as Text.ShowList+import qualified	BishBosh.Type.Count		as Type.Count import qualified	Control.Arrow import qualified	Control.DeepSeq import qualified	Control.Exception@@ -95,22 +95,16 @@ automaticTag :: String automaticTag		= "automatic" --- | The maximum number names, of matching games from the PGN-database, to display.-type MaximumPGNNames	= Int- -- | Defines options related to i/o.-data IOOptions row column	= MkIOOptions {+data IOOptions	= MkIOOptions { 	getMaybeOutputConfigFilePath	:: Maybe System.FilePath.FilePath,		-- ^ An optional path to a file, into which the unprocessed configuration, formatted as XML, should be written (obliterating any existing file-contents).-	getMaybeMaximumPGNNames		:: Maybe MaximumPGNNames,			-- ^ The maximum number names, of matching games from the PGN-database, to display; @Nothing@ implies no maximum.-	getPGNOptionsList		:: [Input.PGNOptions.PGNOptions],		-- ^ How to construct PGN-databases.+	getMaybeMaximumPGNNames		:: Maybe Type.Count.NGames,			-- ^ The maximum number of names to display, of matching games from the PGN-database; @Nothing@ implies unlimited. CAVEAT: pedantically, it's a number of names not a number of games.+	getPGNOptionsList		:: [Input.PGNOptions.PGNOptions],		-- ^ How to construct each PGN-database. 	getMaybePersistence		:: Maybe (System.FilePath.FilePath, Bool),	-- ^ Optional path to a file, into which game-state can be persisted (obliterating any existing content), & whether to save this state automatically after each move.-	getUIOptions			:: Input.UIOptions.UIOptions row column		-- ^ Options which define the user-interface.+	getUIOptions			:: Input.UIOptions.UIOptions			-- ^ Options which define the user-interface. } deriving Eq -instance (-	Control.DeepSeq.NFData	column,-	Control.DeepSeq.NFData	row- ) => Control.DeepSeq.NFData (IOOptions row column) where+instance Control.DeepSeq.NFData IOOptions where 	rnf MkIOOptions { 		getMaybeOutputConfigFilePath	= maybeOutputConfigFilePath, 		getMaybeMaximumPGNNames		= maybeMaximumPGNNames,@@ -125,7 +119,7 @@ 		uiOptions 	 ) -instance (Show column, Show row) => Show (IOOptions row column) where+instance Show IOOptions where 	showsPrec _ MkIOOptions { 		getMaybeOutputConfigFilePath	= maybeOutputConfigFilePath, 		getMaybeMaximumPGNNames		= maybeMaximumPGNNames,@@ -148,7 +142,7 @@ 		) 	 ] -instance (Num column, Num row) => Data.Default.Default (IOOptions row column) where+instance Data.Default.Default IOOptions where 	def = MkIOOptions { 		getMaybeOutputConfigFilePath	= Nothing, 		getMaybeMaximumPGNNames		= Nothing,@@ -157,14 +151,7 @@ 		getUIOptions			= Data.Default.def 	} -instance (-	HXT.XmlPickler	column,-	HXT.XmlPickler	row,-	Integral	column,-	Integral	row,-	Show		column,-	Show		row- ) => HXT.XmlPickler (IOOptions row column) where+instance HXT.XmlPickler IOOptions where 	xpickle	= HXT.xpDefault Data.Default.def . HXT.xpElem tag . HXT.xpWrap ( 		\(a, b, c, d, e) -> mkIOOptions a b c d e,	-- Construct. 		\MkIOOptions {@@ -183,7 +170,7 @@ 	 ) $ HXT.xp5Tuple ( 		HXT.xpOption $ HXT.xpTextAttr outputConfigFilePathTag {-can't be null-} 	 ) (-		HXT.xpAttrImplied maximumPGNNamesTag HXT.xpInt+		HXT.xpAttrImplied maximumPGNNamesTag HXT.xpickle 	 ) HXT.xpickle {-PGNOptions-} ( 		HXT.xpOption $ HXT.xpElem persistenceTag ( 			HXT.xpTextAttr filePathTag `HXT.xpPair` HXT.xpDefault True (HXT.xpAttr automaticTag HXT.xpickle {-Bool-})@@ -193,11 +180,11 @@ -- | Smart constructor. mkIOOptions 	:: Maybe System.FilePath.FilePath		-- ^ An optional path to a file, into which the unprocessed configuration, formatted as XML, should be written (obliterating any existing file-contents).-	-> Maybe MaximumPGNNames			-- ^ The optional maximum number of names, of matching PGN-games, to display; @Nothing@ implies unlimited.+	-> Maybe Type.Count.NGames			-- ^ The optional maximum number of names, of matching PGN-games, to display; @Nothing@ implies unlimited. 	-> [Input.PGNOptions.PGNOptions]		-- ^ How to find & process PGN-databases. 	-> Maybe (System.FilePath.FilePath, Bool)	-- ^ Optional path to a file, into which game-state can be persisted (obliterating any existing content), & whether to save this state automatically after each move.-	-> Input.UIOptions.UIOptions row column-	-> IOOptions row column+	-> Input.UIOptions.UIOptions+	-> IOOptions mkIOOptions maybeOutputConfigFilePath maybeMaximumPGNNames pgnOptionsList maybePersistence uiOptions 	| Data.Maybe.maybe False ( 		not . System.FilePath.isValid {-i.e. non-null on POSIX-}@@ -221,10 +208,10 @@ 		duplicateFilePaths	= Data.Foldable.findDuplicates $ map (System.FilePath.normalise . Input.PGNOptions.getDatabaseFilePath) pgnOptionsList  -- | The type of a function used to transform 'IOOptions'.-type Transformation row column	= IOOptions row column -> IOOptions row column+type Transformation	= IOOptions -> IOOptions  -- | Mutator.-setMaybeOutputConfigFilePath :: Maybe System.FilePath.FilePath -> Transformation row column+setMaybeOutputConfigFilePath :: Maybe System.FilePath.FilePath -> Transformation setMaybeOutputConfigFilePath maybeOutputConfigFilePath ioOptions 	| Data.Maybe.maybe False ( 		not . System.FilePath.isValid {-i.e. non-null on POSIX-}@@ -234,7 +221,7 @@ 	}  -- | Mutator.-setEitherNativeUIOrCECPOptions :: Input.UIOptions.EitherNativeUIOrCECPOptions row column -> Transformation row column+setEitherNativeUIOrCECPOptions :: Input.UIOptions.EitherNativeUIOrCECPOptions -> Transformation setEitherNativeUIOrCECPOptions eitherNativeUIOrCECPOptions ioOptions@MkIOOptions { getUIOptions = uiOptions }	= ioOptions { 	getUIOptions	= uiOptions { 		Input.UIOptions.getEitherNativeUIOrCECPOptions	= eitherNativeUIOrCECPOptions@@ -242,7 +229,7 @@ }  -- | Mutator.-setMaybePrintMoveTree :: Maybe Property.Arboreal.Depth -> Transformation row column+setMaybePrintMoveTree :: Maybe Property.Arboreal.Depth -> Transformation setMaybePrintMoveTree maybePrintMoveTree ioOptions@MkIOOptions { getUIOptions = uiOptions }	= ioOptions { 	getUIOptions	= uiOptions { 		Input.UIOptions.getMaybePrintMoveTree	= maybePrintMoveTree@@ -250,19 +237,19 @@ }  -- | Mutator.-updateCECPFeature :: Input.CECPFeatures.Feature -> Transformation row column+updateCECPFeature :: Input.CECPFeatures.Feature -> Transformation updateCECPFeature feature ioOptions@MkIOOptions { getUIOptions = uiOptions }	= ioOptions { 	getUIOptions	= Input.UIOptions.updateCECPFeature feature uiOptions }  -- | Mutator.-deleteCECPFeature :: Input.CECPFeatures.Feature -> Transformation row column+deleteCECPFeature :: Input.CECPFeatures.Feature -> Transformation deleteCECPFeature feature ioOptions@MkIOOptions { getUIOptions = uiOptions }	= ioOptions { 	getUIOptions	= Input.UIOptions.deleteCECPFeature feature uiOptions }  -- | Mutator.-setVerbosity :: Input.Verbosity.Verbosity -> Transformation row column+setVerbosity :: Input.Verbosity.Verbosity -> Transformation setVerbosity verbosity ioOptions@MkIOOptions { getUIOptions = uiOptions }	= ioOptions { 	getUIOptions	= uiOptions { 		Input.UIOptions.getVerbosity	= verbosity

@@ -25,7 +25,7 @@ module BishBosh.Input.NativeUIOptions( -- * Types -- ** Type-synonyms-	ScreenCoordinates,+--	ScreenCoordinates, -- ** Data-types 	NativeUIOptions( --		MkNativeUIOptions,@@ -46,6 +46,7 @@ import qualified	BishBosh.Attribute.ColourScheme	as Attribute.ColourScheme import qualified	BishBosh.Data.Exception		as Data.Exception import qualified	BishBosh.Text.ShowList		as Text.ShowList+import qualified	BishBosh.Type.Length		as Type.Length import qualified	Control.DeepSeq import qualified	Control.Exception import qualified	Data.Default@@ -67,19 +68,16 @@ nColumnsTag :: String nColumnsTag		= "nColumns" --- | The coordinates used to index the screen.-type ScreenCoordinates row column	= (row, column)+-- | The coordinates used to index the screen. CAVEAT: the name is an anachronistic hang-over from a discarded implementation of a Curses display.+type ScreenCoordinates	= (Type.Length.Row, Type.Length.Column)  -- | Constructor.-data NativeUIOptions row column	= MkNativeUIOptions {-	getBoardMagnification	:: ScreenCoordinates row column,	-- ^ The factor by which the dimensions of the board are stretched when displayed.+data NativeUIOptions	= MkNativeUIOptions {+	getBoardMagnification	:: ScreenCoordinates,	-- ^ The factor by which the dimensions of the board are stretched when displayed. 	getColourScheme		:: Attribute.ColourScheme.ColourScheme } deriving Eq -instance (-	Control.DeepSeq.NFData	column,-	Control.DeepSeq.NFData	row- ) => Control.DeepSeq.NFData (NativeUIOptions row column) where+instance Control.DeepSeq.NFData NativeUIOptions where 	rnf MkNativeUIOptions { 		getBoardMagnification	= boardMagnification, 		getColourScheme		= colourScheme@@ -88,34 +86,27 @@ 		colourScheme 	 ) -instance (Show row, Show column) => Show (NativeUIOptions row column) where-	showsPrec _ MkNativeUIOptions {+instance Show NativeUIOptions where+	showsPrec precision MkNativeUIOptions { 		getBoardMagnification	= boardMagnification, 		getColourScheme		= colourScheme 	} = Text.ShowList.showsAssociationList' [ 		( 			boardMagnificationTag,-			shows boardMagnification+			showsPrec precision boardMagnification 		), ( 			Attribute.ColourScheme.tag,-			shows colourScheme+			showsPrec precision colourScheme 		) 	 ] -instance (Num row, Num column) => Data.Default.Default (NativeUIOptions row column) where+instance Data.Default.Default NativeUIOptions where 	def = MkNativeUIOptions { 		getBoardMagnification	= (1, 1), 		getColourScheme		= Data.Default.def 	} -instance (-	HXT.XmlPickler	column,-	HXT.XmlPickler	row,-	Integral	column,-	Integral	row,-	Show		column,-	Show		row- ) => HXT.XmlPickler (NativeUIOptions row column) where+instance HXT.XmlPickler NativeUIOptions where 	xpickle	= HXT.xpElem tag . HXT.xpWrap ( 		uncurry mkNativeUIOptions,	-- Construct. 		\MkNativeUIOptions {@@ -135,15 +126,10 @@ 		def	= Data.Default.def  -- | Smart constructor.-mkNativeUIOptions :: (-	Integral	column,-	Integral	row,-	Show		column,-	Show		row- )-	=> ScreenCoordinates row column		-- ^ The factor by which the dimensions of the board are stretched when displayed.+mkNativeUIOptions+	:: ScreenCoordinates	-- ^ The factor by which the dimensions of the board are stretched when displayed. 	-> Attribute.ColourScheme.ColourScheme-	-> NativeUIOptions row column+	-> NativeUIOptions mkNativeUIOptions boardMagnification colourScheme 	| uncurry (||) $ ( 		(< 1) *** (< 1)@@ -155,3 +141,4 @@ 		getBoardMagnification	= boardMagnification, 		getColourScheme		= colourScheme 	}+

@@ -59,8 +59,6 @@ ) where  import			BishBosh.Data.Bool()		-- For 'HXT.xpickle'.-import			BishBosh.Data.Integral()	-- For 'HXT.XmlPickler NMoves'.-import qualified	BishBosh.Component.Move			as Component.Move import qualified	BishBosh.Data.Exception			as Data.Exception import qualified	BishBosh.Input.EvaluationOptions	as Input.EvaluationOptions import qualified	BishBosh.Input.IOOptions		as Input.IOOptions@@ -70,6 +68,7 @@ import qualified	BishBosh.Property.Arboreal		as Property.Arboreal import qualified	BishBosh.Property.ShowFloat		as Property.ShowFloat import qualified	BishBosh.Text.ShowList			as Text.ShowList+import qualified	BishBosh.Type.Count			as Type.Count import qualified	Control.DeepSeq import qualified	Control.Exception import qualified	Data.Default@@ -93,23 +92,19 @@ type RandomSeed	= Int  -- | Defines the application's options.-data Options column criterionWeight pieceSquareValue rankValue row x y	= MkOptions {-	getMaybeMaximumPlies	:: Maybe Component.Move.NPlies,									-- ^ The maximum number of plies before the game is terminated; required for profiling the application.-	getMaybeRandomSeed	:: Maybe RandomSeed,										-- ^ Optionally seed the pseudo-random number-generator to produce a repeatable sequence.-	getEvaluationOptions	:: Input.EvaluationOptions.EvaluationOptions criterionWeight pieceSquareValue rankValue x y,	-- ^ The single set of options by which all automated /move/s are evaluated.-	getSearchOptions	:: Input.SearchOptions.SearchOptions,								-- ^ The options by which to automatically select /move/s.-	getIOOptions		:: Input.IOOptions.IOOptions row column								-- ^ The /ioOptions/ by which to receive commands & present results.+data Options pieceSquareValue x y	= MkOptions {+	getMaybeMaximumPlies	:: Maybe Type.Count.NPlies,						-- ^ The maximum number of plies before the game is terminated; required for profiling the application.+	getMaybeRandomSeed	:: Maybe RandomSeed,							-- ^ Optionally seed the pseudo-random number-generator to produce a repeatable sequence.+	getEvaluationOptions	:: Input.EvaluationOptions.EvaluationOptions pieceSquareValue x y,	-- ^ The single set of options by which all automated /move/s are evaluated.+	getSearchOptions	:: Input.SearchOptions.SearchOptions,					-- ^ The options by which to automatically select /move/s.+	getIOOptions		:: Input.IOOptions.IOOptions						-- ^ The /ioOptions/ by which to receive commands & present results. } deriving (Eq, Show)  instance (-	Control.DeepSeq.NFData	column,-	Control.DeepSeq.NFData	criterionWeight, 	Control.DeepSeq.NFData	pieceSquareValue,-	Control.DeepSeq.NFData	rankValue,-	Control.DeepSeq.NFData	row, 	Control.DeepSeq.NFData	x, 	Control.DeepSeq.NFData	y- ) => Control.DeepSeq.NFData (Options column criterionWeight pieceSquareValue rankValue row x y) where+ ) => Control.DeepSeq.NFData (Options pieceSquareValue x y) where 	rnf MkOptions { 		getMaybeMaximumPlies	= maybeMaximumPlies, 		getMaybeRandomSeed	= maybeRandomSeed,@@ -123,13 +118,9 @@ 	Enum	y, 	Ord	x, 	Ord	y,-	Real	criterionWeight, 	Real	pieceSquareValue,-	Real	rankValue,-	Show	column,-	Show	pieceSquareValue,-	Show	row- ) => Property.ShowFloat.ShowFloat (Options column criterionWeight pieceSquareValue rankValue row x y) where+	Show	pieceSquareValue+ ) => Property.ShowFloat.ShowFloat (Options pieceSquareValue x y) where 	showsFloat fromDouble MkOptions { 		getMaybeMaximumPlies	= maybeMaximumPlies, 		getMaybeRandomSeed	= maybeRandomSeed,@@ -153,14 +144,7 @@ 		) 	 ] -instance (-	Fractional	rankValue,-	Num		criterionWeight,-	Num		column,-	Num		row,-	Ord		rankValue,-	Show		rankValue- ) => Data.Default.Default (Options column criterionWeight pieceSquareValue rankValue row x y) where+instance Data.Default.Default (Options pieceSquareValue x y) where 	def = MkOptions { 		getMaybeMaximumPlies	= Nothing, 		getMaybeRandomSeed	= Nothing,@@ -173,26 +157,12 @@ 	Enum		x, 	Enum		y, 	Fractional	pieceSquareValue,-	Fractional	rankValue,-	HXT.XmlPickler	column,-	HXT.XmlPickler	criterionWeight,-	HXT.XmlPickler	rankValue,-	HXT.XmlPickler	row,-	Integral	column,-	Integral	row,-	Num		criterionWeight, 	Ord		pieceSquareValue,-	Ord		rankValue, 	Ord		x, 	Ord		y,-	Real		criterionWeight, 	Real		pieceSquareValue,-	Show		column,-	Show		criterionWeight,-	Show		pieceSquareValue,-	Show		rankValue,-	Show		row- ) => HXT.XmlPickler (Options column criterionWeight pieceSquareValue rankValue row x y) where+	Show		pieceSquareValue+ ) => HXT.XmlPickler (Options pieceSquareValue x y) where 	xpickle	= HXT.xpElem tag . HXT.xpWrap ( 		\(a, b, c, d, e) -> mkOptions a b c d e,	-- Construct. 		\MkOptions {@@ -209,19 +179,19 @@ 			ioOptions 		) -- Deconstruct. 	 ) $ HXT.xp5Tuple (-		HXT.xpAttrImplied maximumPliesTag HXT.xpInt {-NMoves-}+		HXT.xpAttrImplied maximumPliesTag HXT.xpickle {-NPlies-} 	 ) ( 		HXT.xpAttrImplied randomSeedTag HXT.xpInt 	 ) HXT.xpickle {-EvaluationOptions-} HXT.xpickle {-SearchOptions-} HXT.xpickle {-IOOptions-}  -- | Smart constructor. mkOptions-	:: Maybe Component.Move.NPlies	-- ^ The maximum number of plies before the game is terminated; required for profiling the application.+	:: Maybe Type.Count.NPlies	-- ^ The maximum number of plies before the game is terminated; required for profiling the application. 	-> Maybe RandomSeed		-- ^ Optionally seed the pseudo-random number-generator to produce a repeatable sequence.-	-> Input.EvaluationOptions.EvaluationOptions criterionWeight pieceSquareValue rankValue x y+	-> Input.EvaluationOptions.EvaluationOptions pieceSquareValue x y 	-> Input.SearchOptions.SearchOptions-	-> Input.IOOptions.IOOptions row column-	-> Options column criterionWeight pieceSquareValue rankValue row x y+	-> Input.IOOptions.IOOptions+	-> Options pieceSquareValue x y mkOptions maybeMaximumPlies maybeRandomSeed evaluationOptions searchOptions ioOptions 	| Just maximumPlies	<- maybeMaximumPlies 	, maximumPlies <= 0	= Control.Exception.throw . Data.Exception.mkOutOfBounds . showString "BishBosh.Input.Options.mkOptions:\t" . showString maximumPliesTag . Text.ShowList.showsAssociation $ shows maximumPlies " must exceed zero."@@ -234,22 +204,22 @@ 	}  -- | The type of a function used to transform 'Options'.-type Transformation column criterionWeight pieceSquareValue rankValue row x y	= Options column criterionWeight pieceSquareValue rankValue row x y -> Options column criterionWeight pieceSquareValue rankValue row x y+type Transformation pieceSquareValue x y	= Options pieceSquareValue x y -> Options pieceSquareValue x y  -- | Mutator.-setMaybeOutputConfigFilePath :: Maybe System.FilePath.FilePath -> Transformation column criterionWeight pieceSquareValue rankValue row x y+setMaybeOutputConfigFilePath :: Maybe System.FilePath.FilePath -> Transformation pieceSquareValue x y setMaybeOutputConfigFilePath maybeOutputConfigFilePath options@MkOptions { getIOOptions	= ioOptions }	= options { 	getIOOptions	= Input.IOOptions.setMaybeOutputConfigFilePath maybeOutputConfigFilePath ioOptions }  -- | Mutator.-setMaybeRandomSeed :: Maybe RandomSeed -> Transformation column criterionWeight pieceSquareValue rankValue row x y+setMaybeRandomSeed :: Maybe RandomSeed -> Transformation pieceSquareValue x y setMaybeRandomSeed maybeRandomSeed options	= options { 	getMaybeRandomSeed	= maybeRandomSeed }  -- | Mutator.-setMaybePersistence :: Maybe (System.FilePath.FilePath, Bool) -> Transformation column criterionWeight pieceSquareValue rankValue row x y+setMaybePersistence :: Maybe (System.FilePath.FilePath, Bool) -> Transformation pieceSquareValue x y setMaybePersistence maybePersistence options@MkOptions { getIOOptions = ioOptions }	= options { 	getIOOptions	= ioOptions { 		Input.IOOptions.getMaybePersistence	= maybePersistence@@ -257,25 +227,25 @@ }  -- | Mutator.-setVerbosity :: Input.Verbosity.Verbosity -> Transformation column criterionWeight pieceSquareValue rankValue row x y+setVerbosity :: Input.Verbosity.Verbosity -> Transformation pieceSquareValue x y setVerbosity verbosity options@MkOptions { getIOOptions = ioOptions }	= options { 	getIOOptions	= Input.IOOptions.setVerbosity verbosity ioOptions }  -- | Mutator.-setEitherNativeUIOrCECPOptions :: Input.UIOptions.EitherNativeUIOrCECPOptions row column -> Transformation column criterionWeight pieceSquareValue rankValue row x y+setEitherNativeUIOrCECPOptions :: Input.UIOptions.EitherNativeUIOrCECPOptions -> Transformation pieceSquareValue x y setEitherNativeUIOrCECPOptions eitherNativeUIOrCECPOptions options@MkOptions { getIOOptions = ioOptions }	= options { 	getIOOptions	= Input.IOOptions.setEitherNativeUIOrCECPOptions eitherNativeUIOrCECPOptions ioOptions }  -- | Mutator.-setMaybePrintMoveTree :: Maybe Property.Arboreal.Depth -> Transformation column criterionWeight pieceSquareValue rankValue row x y+setMaybePrintMoveTree :: Maybe Property.Arboreal.Depth -> Transformation pieceSquareValue x y setMaybePrintMoveTree maybePrintMoveTree options@MkOptions { getIOOptions = ioOptions }	= options { 	getIOOptions	= Input.IOOptions.setMaybePrintMoveTree maybePrintMoveTree ioOptions }  -- | Mutator.-swapSearchDepth :: Transformation column criterionWeight pieceSquareValue rankValue row x y+swapSearchDepth :: Transformation pieceSquareValue x y swapSearchDepth options@MkOptions { getSearchOptions = searchOptions }	= options { 	getSearchOptions	= Input.SearchOptions.swapSearchDepth searchOptions }