Goto Chapter: Top 1 2 3 4 5 6 7 8 Bib Ind

[Top of Book] [Contents] [Next Chapter]

BacktrackKit

An extensible, easy to understand backtracking framework

0.6.2

28 January 2022

Christopher Jefferson
Email: caj21@st-andrews.ac.uk
Homepage: http://caj.host.cs.st-andrews.ac.uk/
Address:
School of Computer Science
University of St Andrews
Jack Cole Building, North Haugh
St Andrews, Fife, KY16 9SX
United Kingdom

Wilf A. Wilson
Email: gap@wilf-wilson.net
Homepage: https://wilf.me

Contents

2 Executing a search

2.1 The main search interface

  2.1-1 BTKit_SimpleSearch
  2.1-2 BTKit_SimpleSinglePermSearch
  2.1-3 BTKit_SimpleAllPermSearch

2.2 Extra information and stats

2.2-1 InfoBTKit
2.2-2 BTKit_ResetStats

3 Implementation

  3.1-1 IsBacktrackableState
  3.1-2 IsBTKitState
  3.1-3 BacktrackableStateFamily
  3.1-4 BTKitStateType
  3.1-5 SaveState
  3.1-6 RestoreState
  3.1-7 ConsolidateState

3.2 Applying refiners

  3.2-1 InitialiseConstraints
  3.2-2 RefineConstraints
  3.2-3 FinaliseRBaseForConstraints
  3.2-4 ApplyFilters

3.3 Currently unorganised stuff

  3.3-1 BTKit_BuildProblem
  3.3-2 FirstFixedPoint
  3.3-3 BuildRBase
  3.3-4 Backtrack

5.1 Introduction to refiners

5.2 The record refine

5.3 Constructing refiners

5.3-1 DummyRefiner

7 Ordered tracers

  7.1-1 RecordingTracer
  7.1-2 FollowingTracer
  7.1-3 CanonicalisingTracerFromTracer
  7.1-4 EmptyCanonicalisingTracer
  7.1-5 IsTracer
  7.1-6 AddEvent
  7.1-7 TraceLength
  7.1-8 TraceEvent
  7.1-9 GetEvents

8.1 Partition Stacks

[Top of Book] [Contents] [Next Chapter]

Goto Chapter: Top 1 2 3 4 5 6 7 8 Bib Ind

generated by GAPDoc2HTML