diff --git a/docs/default.html b/docs/default.html
index 51505e21..2f10c856 100644
--- a/docs/default.html
+++ b/docs/default.html
@@ -1,9 +1,10 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <html>
-<link rel="icon" href="icons/nicon16.png" type="image/png">
 <head>
+<link rel="icon" href="icons/nicon16.png" type="image/png">
+<meta http-equiv="refresh" content="3;url=niqlow.ox.html" />
 <style>
-body {  
+body {
     background-image: url("niqlow.svg");
     background-repeat:no-repeat;
     background-color:#980000ff ;
diff --git a/docs/index.html b/docs/index.html
index 51505e21..2f10c856 100644
--- a/docs/index.html
+++ b/docs/index.html
@@ -1,9 +1,10 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <html>
-<link rel="icon" href="icons/nicon16.png" type="image/png">
 <head>
+<link rel="icon" href="icons/nicon16.png" type="image/png">
+<meta http-equiv="refresh" content="3;url=niqlow.ox.html" />
 <style>
-body {  
+body {
     background-image: url("niqlow.svg");
     background-repeat:no-repeat;
     background-color:#980000ff ;
diff --git a/docs/niqlow.ox.html b/docs/niqlow.ox.html
index 7c88e0a6..7777294e 100644
--- a/docs/niqlow.ox.html
+++ b/docs/niqlow.ox.html
@@ -47,8 +47,8 @@ <h1><span class="icon"><img class="icon" src="icons/file.png">&nbsp;</span><span
 <P/>
 <td><details class="over"><summary>Step 2. Solve the model</summary>
 <ul>
-<li>Use of the solution built in <a href="">Method</a>s to solve Bellman's equation for your model.</li>
-<li>Create <a href="">Data</a> outcomes for the solution.</td>
+<li>Use the <a href="DDP/Methods.ox.html">Method</a>s to solve Bellman's equation and compute choice probabilities for your model.</li>
+<li>Create <a href="DDP/Data.ox.html">Data</a> outcomes for the solution (simulated sample or predictions).</td>
 </ul></details>
 <td><details class="over"><summary>Step 3. Find parameter values</summary>
 <UL><li>Use the integrated  <a href="FiveO/default.html">FiveO</a> tools to maximize an objective or solve a system of
diff --git a/examples/DDP/AllTest.ox b/examples/DDP/AllTest.ox
index 0d04b23b..14cce2be 100644
--- a/examples/DDP/AllTest.ox
+++ b/examples/DDP/AllTest.ox
@@ -1,5 +1,5 @@
 #include "AllTest.h"
-/* This file is part of niqlow. Copyright (C) 2011-2021 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** This creates and returns a menu for the test programs, called in examples/DDP/examples. **/
 TestRun() {
diff --git a/examples/FiveO/AllTestOpt.h b/examples/FiveO/AllTestOpt.h
index dacd819c..e5ddbdc0 100644
--- a/examples/FiveO/AllTestOpt.h
+++ b/examples/FiveO/AllTestOpt.h
@@ -2,7 +2,7 @@
 **/
 #import "FiveO"
 #import "menu"
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 #ifndef _RB
 #define _RB
 #include "Rosenbrock.ox"
diff --git a/examples/FiveO/AllTestOpt.ox b/examples/FiveO/AllTestOpt.ox
index ef5ed0ee..e08c05b5 100644
--- a/examples/FiveO/AllTestOpt.ox
+++ b/examples/FiveO/AllTestOpt.ox
@@ -1,5 +1,5 @@
 #include "AllTestOpt.h"
-/* This file is part of niqlow. Copyright (C) 2011-2021 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** Produce menu of simple uses of FiveO.**/
 OptTestRun() {
diff --git a/examples/FiveO/GetStartedFiveO.ox b/examples/FiveO/GetStartedFiveO.ox
index 674fe6ad..0413c7ac 100644
--- a/examples/FiveO/GetStartedFiveO.ox
+++ b/examples/FiveO/GetStartedFiveO.ox
@@ -5,7 +5,7 @@
 #include "Rosenbrock.ox"
 #endif
 #include "SysExample.ox"
-/* This file is part of niqlow. Copyright (C) 2011-2021 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 static decl key;
 GS5OA() {
diff --git a/examples/main.ox b/examples/main.ox
index c3beeb24..887d5304 100644
--- a/examples/main.ox
+++ b/examples/main.ox
@@ -1,5 +1,5 @@
 #include "main.h"
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 	
 /** Present a menu of test, sample and replication functions to call; will also read options from
 the command line.
diff --git a/examples/misc/DynamicWstar.ox b/examples/misc/DynamicWstar.ox
index 94d014e4..43aff973 100644
--- a/examples/misc/DynamicWstar.ox
+++ b/examples/misc/DynamicWstar.ox
@@ -1,5 +1,5 @@
 #include "DynamicWstar.h"
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 DynWStar::Reachable()	{    return (CV(m)||!CV(keptz));    }
 DynWStar::DynWStar()    { zstar = zeros(N::R,1); oxrunerror("should get rid of N::R");}
diff --git a/examples/misc/StataMNP.ox b/examples/misc/StataMNP.ox
index 8bd363c5..868e83ed 100644
--- a/examples/misc/StataMNP.ox
+++ b/examples/misc/StataMNP.ox
@@ -1,5 +1,5 @@
 #include "StataMNP.h"
-/* This file is part of niqlow. Copyright (C) 2011-2012 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 StataMNP()	{
 	format(250);
diff --git a/examples/misc/StataMNP.oxdoc b/examples/misc/StataMNP.oxdoc
index 5619cee1..d1d5b43e 100644
--- a/examples/misc/StataMNP.oxdoc
+++ b/examples/misc/StataMNP.oxdoc
@@ -49,5 +49,5 @@ Cons            -0.985592056717    0.413310145637    -2.38463068744
 
 <a href="../output/StataMNP.txt">Complete (noisy) output</a>
 
-@author &copy; 2011-2022 <a href="http://econ.queensu.ca/~ferrall">Christopher Ferrall</a></dd>
+@author &copy; 2011-2023 <a href="http://econ.queensu.ca/~ferrall">Christopher Ferrall</a></dd>
 **/
diff --git a/examples/replications/BerkovecSternEmet1991.ox b/examples/replications/BerkovecSternEmet1991.ox
index b2abe095..3d85e062 100644
--- a/examples/replications/BerkovecSternEmet1991.ox
+++ b/examples/replications/BerkovecSternEmet1991.ox
@@ -1,5 +1,5 @@
 #include "BerkovecSternEmet1991.h"
-/* This file is part of niqlow. Copyright (C) 2011-2018 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** Setup and solve the model for both columns.**/	
 Retirement::Run()	{
diff --git a/examples/replications/GilleskieEmet1998.ox b/examples/replications/GilleskieEmet1998.ox
index 234dab64..ccc4a38d 100644
--- a/examples/replications/GilleskieEmet1998.ox
+++ b/examples/replications/GilleskieEmet1998.ox
@@ -1,5 +1,5 @@
 #include "GilleskieEmet1998.h"
-/* This file is part of niqlow. Copyright (C) 2011-2013 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 DynaHealth::NewEpisode() { return !spell.k.v; }	
 
diff --git a/examples/replications/KeaneWolpinJPE1997.h b/examples/replications/KeaneWolpinJPE1997.h
index 48768240..cffa461b 100644
--- a/examples/replications/KeaneWolpinJPE1997.h
+++ b/examples/replications/KeaneWolpinJPE1997.h
@@ -1,5 +1,5 @@
 #import "DDP"
-/* This file is part of niqlow. Copyright (C) 2012-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2012-2023 Christopher Ferrall */
 
 
 struct KWJPE97 : ExPostSmoothing	{
diff --git a/examples/replications/KeaneWolpinJPE1997.ox b/examples/replications/KeaneWolpinJPE1997.ox
index 7b50525c..8cc9ca39 100644
--- a/examples/replications/KeaneWolpinJPE1997.ox
+++ b/examples/replications/KeaneWolpinJPE1997.ox
@@ -1,5 +1,5 @@
 #include "KeaneWolpinJPE1997.h"
-/* This file is part of niqlow. Copyright (C) 2019-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2019-2023 Christopher Ferrall */
 
 /** Distribution of fixed effects conditional on initial schooling level.**/
 KWJPE97::kdist(...) { return kprob[][CV(isch)]; }
diff --git a/examples/replications/KeaneWolpinREStat1994.oxdoc b/examples/replications/KeaneWolpinREStat1994.oxdoc
index 65b3856f..a18c9413 100644
--- a/examples/replications/KeaneWolpinREStat1994.oxdoc
+++ b/examples/replications/KeaneWolpinREStat1994.oxdoc
@@ -77,6 +77,6 @@ Note that &Ecirc;max is defined to be at least maxE, and when the algorithm has
 <DD class="example"><details><summary>Output <a href="javascript:popoxcode('../../../examples/output/KeaneWolpinREStat1994.txt');">niqlow/examples/output/KeaneWolpinREStat1994.txt</a></summary>
 <pre><object width="75%" height="200" type="text/plain" data="../../../examples/output/KeaneWolpinREStat1994.txt" border="1" ></object></pre></details></DD>
 
-@author &copy; 2011-2021 <a href="https://ferrall.github.io/">Christopher Ferrall</a></dd>
+@author &copy; 2011-2023 <a href="https://ferrall.github.io/">Christopher Ferrall</a></dd>
 
 **/
diff --git a/examples/replications/RustEmet1987mle.h b/examples/replications/RustEmet1987mle.h
index c3bcc328..fe2c952d 100644
--- a/examples/replications/RustEmet1987mle.h
+++ b/examples/replications/RustEmet1987mle.h
@@ -1,6 +1,6 @@
 #import "RustEmet1987"
 #import "FiveO"
-/* This file is part of niqlow. Copyright (C) 2011-2022 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** Contains objects related to estimation in a catchall class.
 
diff --git a/examples/replications/RustEmet1987mle.ox b/examples/replications/RustEmet1987mle.ox
index d5cecabc..3b956da0 100644
--- a/examples/replications/RustEmet1987mle.ox
+++ b/examples/replications/RustEmet1987mle.ox
@@ -1,5 +1,5 @@
 #include "RustEmet1987mle.h"
-/* This file is part of niqlow. Copyright (C) 2011-2022 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** Creates the interactive menu items for choosing method, table, column, and row to replicate.**/
 RustEstimates::menu() {
diff --git a/examples/replications/WolpinEmet1987.ox b/examples/replications/WolpinEmet1987.ox
index eadc96cd..b76bac59 100644
--- a/examples/replications/WolpinEmet1987.ox
+++ b/examples/replications/WolpinEmet1987.ox
@@ -1,5 +1,5 @@
 #include "WolpinEmet1987.h"
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 SchToWork::Replicate() {
 	Initialize(new SchToWork(),new BinaryChoice("accept"));
diff --git a/examples/replications/WolpinJPE1984.ox b/examples/replications/WolpinJPE1984.ox
index 7242e84f..ce74400e 100644
--- a/examples/replications/WolpinJPE1984.ox
+++ b/examples/replications/WolpinJPE1984.ox
@@ -1,5 +1,5 @@
 #include "WolpinJPE1984.h"
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /**Run the  replication, compute predictions.
 **/
diff --git a/examples/replications/replications.ox b/examples/replications/replications.ox
index ff68795c..58ee494d 100644
--- a/examples/replications/replications.ox
+++ b/examples/replications/replications.ox
@@ -1,7 +1,7 @@
 /** Menus of programs to  replicate published DDP work: see <a href="replications/default.html">documentation</a>.
 **/
 #include "replications.h"
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** Options built closely on Rust 1987.**/
 rust87menu() {
diff --git a/include/Algorithms.h b/include/Algorithms.h
index 390e2745..0b83c00d 100644
--- a/include/Algorithms.h
+++ b/include/Algorithms.h
@@ -1,6 +1,6 @@
 #import "Shared"
 #import <solveqp>
-/* This file is part of niqlow. Copyright (C) 2012-2021 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2012-2023 Christopher Ferrall */
 
 /** Base class for optimization and system-solving algorithms.
 
diff --git a/include/Bellman.h b/include/Bellman.h
index 38f87ba8..3f0e9b6c 100644
--- a/include/Bellman.h
+++ b/include/Bellman.h
@@ -1,5 +1,5 @@
 #import "DP"
-/* This file is part of niqlow. Copyright (C) 2011-2021 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** Base class for any DP problem and each point $\theta$ in the endogenous state space.
 
diff --git a/include/DP.h b/include/DP.h
index 9e28520a..bb7f0dad 100644
--- a/include/DP.h
+++ b/include/DP.h
@@ -1,5 +1,5 @@
 #import "Variables"
-/* This file is part of niqlow. Copyright (C) 2011-2021 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 #ifdef OX_PARALLEL
 extern decl
diff --git a/include/Objective.h b/include/Objective.h
index 78dde103..76485f4e 100644
--- a/include/Objective.h
+++ b/include/Objective.h
@@ -1,6 +1,6 @@
 #import "Parameters"
 #import <database>
-/* This file is part of niqlow. Copyright (C) 2012-2021 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2012-2023 Christopher Ferrall */
 
 /** Tags for Gradient-based optimization algorithms.	@name QuasiAlgorithms**/	
 enum{USEBHHH,USEBFGS,USEDFP,USESTEEP,USENEWTON,QuasiAlgorithms}
diff --git a/include/Outcomes.h b/include/Outcomes.h
index b2f1bed5..7405693b 100644
--- a/include/Outcomes.h
+++ b/include/Outcomes.h
@@ -1,7 +1,7 @@
 #import "database"
 #import "Bellman"
 
-/* This file is part of niqlow. Copyright (C) 2012-2021 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2012-2023 Christopher Ferrall */
 
 SimulateOutcomes(Nsim=UseDefault,T=UseDefault,fname=UseDefault,ErgOrStateMat=0,DropTerminal=FALSE);
 
diff --git a/include/Parameters.h b/include/Parameters.h
index 71c057e9..50e0c8ca 100644
--- a/include/Parameters.h
+++ b/include/Parameters.h
@@ -1,5 +1,5 @@
 #import "Shared"
-/* This file is part of niqlow. Copyright (C) 2012-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2012-2023 Christopher Ferrall */
 
 NormalDistParmeters(L,ivals=<0.0;1.0>);
 
@@ -161,7 +161,7 @@ struct ParameterBlock : Parameter {
 	           ParameterBlock(L="PB",...);
 	           AddToBlock(...);
 	           ToggleDoNotVary(elements=DoAll);
-               SetDoNotVary(setting); 
+               SetDoNotVary(setting);
                Xb(X);
 	virtual    BlockCode();
 	virtual    Encode();
diff --git a/include/Predictions.h b/include/Predictions.h
index 84922f52..849ec288 100644
--- a/include/Predictions.h
+++ b/include/Predictions.h
@@ -1,6 +1,6 @@
 #import "database"
 #import "Bellman"
-/* This file is part of niqlow. Copyright (C) 2012-2021 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2012-2023 Christopher Ferrall */
 
 ComputePredictions(T=UseDefault,prtlevel=Two);
 
diff --git a/include/ReservationValues.h b/include/ReservationValues.h
index e197307d..b1247926 100644
--- a/include/ReservationValues.h
+++ b/include/ReservationValues.h
@@ -1,5 +1,5 @@
 #import "FiveO"
-/* This file is part of niqlow. Copyright (C) 2012-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2012-2023 Christopher Ferrall */
 
 RVSolve(ToScreen=TRUE,aM=FALSE);
 
diff --git a/include/Shared.h b/include/Shared.h
index 4d4f89f2..e6ba6601 100644
--- a/include/Shared.h
+++ b/include/Shared.h
@@ -12,7 +12,7 @@
 
 </OL>
 
-@author &copy; 2011-2021 <a href="https://ferrall.github.io/">Christopher Ferrall</a> </dd>
+@author &copy; 2011-2023 <a href="https://ferrall.github.io/">Christopher Ferrall</a> </dd>
 <a name="auto"><hr><h1>Documentation of  Items Defined in Shared.ox <a href="#"><span class="skip"><abbr title=" Back to top">&nbsp;&#8679;&nbsp;</abbr></span></a></h1></a>
 
 **/
@@ -24,7 +24,7 @@
 
 //	extern "CFcurl,fget"   			curl_get(url,file);
 
-/* This file is part of niqlow. Copyright (C) 2012-2021 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2012-2023 Christopher Ferrall */
 
 	/** Pseudonyms for -3, -2, &hellip;. @name Names_for_Integers **/
 enum {Zero, One, Two, Three,
diff --git a/include/StateVariable.h b/include/StateVariable.h
index e0025321..dfe386c9 100644
--- a/include/StateVariable.h
+++ b/include/StateVariable.h
@@ -1,5 +1,5 @@
 #import "DDPShared"
-/* This file is part of niqlow. Copyright (C) 2012-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2012-2023 Christopher Ferrall */
 
 		/** . elements of array returned by `StateVariable::Transit` @name TransOutput **/
 enum {Qind,Qprob,TransOutput}
@@ -62,7 +62,7 @@ As a transition function:
 $$q' = q + I\{s=1\}.$$
 As a transition probability:
 $$P(q'; q,s) = I\{ q' = q + I\{s=1\} \}.$$
-
+</dd>
 **/
 class NonRandom : Autonomous { }
 
@@ -358,6 +358,7 @@ struct Markov : Random {
 <pre>
 decl health = new IIDJump("h",<0.1;0.8;0.1>);
 </pre>
+</dd>
 
 @comments Unlike a general Markov variable, a IIDJump is eligible to be an Exogenous variable, a member of $\epsilon$
 added to the model with `DP::ExogenousStates`.
@@ -468,7 +469,7 @@ Fertility::Mortality()	{
 	decl p = probn(x*q);  // x has to be updated using current age and other x values.
 	decl ivals = CV(i);
 	return 0 ~ (1-p*ivals) ~ p*ivals;
-	}</pre>
+	}</pre></dd>
 **/
 struct RandomUpDown : Random	{
     enum { down, hold, up, NRUP}
@@ -674,7 +675,7 @@ The values of <code>x</code> in $\tau$ (ToTrack)
 @example
 <pre>
 decl wks  = new ActionState("wksunemp",work,10,<0>); //track up to 10 years
-EndogenousStates(wks);</pre>
+EndogenousStates(wks);</pre></dd>
 **/
 struct StateCounter : Counter  {
 	StateCounter(L,N,Target,ToTrack=<1>,Reset=FALSE,Prune=TRUE);
@@ -699,10 +700,10 @@ struct StateCounterMaster: StateCounter  {
 $$s' = s+I\{ CV(x) \in tau\}I\{s \lt N-1\}.$$
 
 @example
-<code><pre>
+<pre>
 decl exper = new ActionCounter("Yrs Experience",10,work); //track up to 10 years working
 EndogenousStates(exper);
-</pre></code></DD>
+</pre></DD>
 
 **/
 struct ActionCounter : Counter  {
@@ -769,8 +770,8 @@ This variable requires a target s.X and the lagged value of the target, denoted
 <DT>Transition:</DT>
 $$s' = I\{ x = Lag(x)\}(s+ I\{s \lt N-1\}).$$
 @example
-<code><pre>
-</pre></code></DD>
+<pre>
+</pre></DD>
 **/
 struct Duration : Counter {
 	const decl Current, Lag, isact, MaxOnce;
@@ -785,8 +786,8 @@ struct Duration : Counter {
 s' = .
 </pre></dd>
 @example
-<code><pre>
-</pre></code>
+<pre>
+</pre></dd>
 **/
 struct RetainMatch : NonRandom {
 	const decl matchvalue, acc, replace, keep;
@@ -837,7 +838,7 @@ Zurcher::Initialize()	{
 	EndogenousState( x = new Renewal("x",90,i,q) );
     &vellip;
 	}
-</pre>
+</pre></dd>
 **/
 struct Renewal : Random {
 	const decl
diff --git a/include/TimeInvariant.h b/include/TimeInvariant.h
index 696217ec..bf8aa841 100644
--- a/include/TimeInvariant.h
+++ b/include/TimeInvariant.h
@@ -1,5 +1,5 @@
 #import "StateVariable"
-/* This file is part of niqlow. Copyright (C) 2012-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2012-2023 Christopher Ferrall */
 
 /** Base container for an element of the group vector $\gamma$.
 **/
diff --git a/include/ValueIteration.h b/include/ValueIteration.h
index 7c376d7d..9ae4e7b2 100644
--- a/include/ValueIteration.h
+++ b/include/ValueIteration.h
@@ -1,5 +1,5 @@
 #import "Bellman"
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** stages of Keane-Wolpin approximation @name KWstages **/
 enum {AddToSample,ComputeBhat,PredictEV,NKWstages}
diff --git a/source/About/Acknowledgements b/source/About/Acknowledgements
index 75905a34..71f1ee87 100644
--- a/source/About/Acknowledgements
+++ b/source/About/Acknowledgements
@@ -2,13 +2,13 @@
 <UL>
 <LI>Documentation for any code contributed by other people includes an acknowledgement or the person is listed in the OxDoc &amp;author field.</LI>
 
-<LI>Thanks to seminar participants at: Minnesota (2013), Dalhousie (2014), and Melbourne (2016).</LI>
+<LI>Thanks to seminar participants at: Minnesota (2013), Dalhousie (2014), Melbourne (2016) and Guelph (2019).</LI>
 
 <LI>Some code and documentation were written while visiting the Department of Economics, UC-Santa Barbara in 2012.</LI>
 
 <LI>Thanks to <a href="www.doornik.com">Jurgen Doornik</a> for creating and maintaining Ox.  If there were justice in the world no economist would use Matlab.</LI>
 
-<LI>Thanks to <a href="">Yori Zwols</a> for creating <a href="https://github.com/yozw/oxdoc">OxDoc</a> and responding to my many requests even though he moved on long ago.</LI>
+<LI>Thanks to <a href="https://github.com/yozw">Yori Zwols</a> for creating <a href="https://github.com/yozw/oxdoc">OxDoc</a> and responding to my many requests even though he moved on long ago.</LI>
 
 <LI>Thanks to Patrick Day for his early work on this project.  His code did not end up in <span class="n">niqlow</span> but it challenged me to follow through on the original approach.</LI>
 
@@ -17,6 +17,6 @@
 <LI>What's in a name?  As usual in dynamic programming, work backwards to find the answer.</LI>
 </UL>
 
-@author  &copy; 2011-2017 <a href="http://econ.queensu.ca/~ferrall">Christopher Ferrall</a>.
+@author  &copy; 2011-2023 <a href="http://econ.queensu.ca/~ferrall">Christopher Ferrall</a>.
 
 **/
diff --git a/source/About/Install b/source/About/Install
index e00aa454..9be37026 100644
--- a/source/About/Install
+++ b/source/About/Install
@@ -1,5 +1,8 @@
 /**
 Acquire, Install and Use <span class="n">niqlow</span>.
+
+<h3><a href="https://ferrallc.screencasthost.com/niqlow">Screenshot Guide to Installation.</a></h3>
+
 <ol class="contents">Steps
 <LI>Get and install Ox (if necessary)</LI>
 <LI>Get <span class="n">niqlow</span></LI>
diff --git a/source/About/License b/source/About/License
index 7ae8d63e..08efaba7 100644
--- a/source/About/License
+++ b/source/About/License
@@ -14,6 +14,6 @@
 
 </UL>
 
-@author  &copy; 2011-2019 <a href="http://econ.queensu.ca/~ferrall">Christopher Ferrall</a>.
+@author  &copy; 2011-2023 <a href="http://econ.queensu.ca/~ferrall">Christopher Ferrall</a>.
 
 **/
diff --git a/source/DDP/AuxiliaryValues.ox b/source/DDP/AuxiliaryValues.ox
index a0bd293b..8fafd7dc 100644
--- a/source/DDP/AuxiliaryValues.ox
+++ b/source/DDP/AuxiliaryValues.ox
@@ -1,7 +1,7 @@
 #ifndef Vh
     #include "AuxiliaryValues.h"
 #endif
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** Create a new element of &chi;, the space of auxiliary outcomes.
 
diff --git a/source/DDP/Bellman.ox b/source/DDP/Bellman.ox
index a8503e84..d03fc7a0 100644
--- a/source/DDP/Bellman.ox
+++ b/source/DDP/Bellman.ox
@@ -1,5 +1,5 @@
 #include "Bellman.h"
-/* This file is part of niqlow. Copyright (C) 2011-2021 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** Task to construct $\theta$ transition, the endogenous state vector.
 <mark>Not called by User code directly</mark>
diff --git a/source/DDP/Bellman.oxdoc b/source/DDP/Bellman.oxdoc
index a4f5cc20..71c6c466 100644
--- a/source/DDP/Bellman.oxdoc
+++ b/source/DDP/Bellman.oxdoc
@@ -44,9 +44,9 @@ V(\zeta,\epsilon,\eta,\theta)\quad &=\quad\max_{\alpha\in A(\theta)}\ v(\alpha;\
 
 The integration over $\zeta$ is carried out internally by the virtual `Bellman::thetaEMax`() or its replacement and does not have to be coded by the user. The default method,  `Bellman::thetaEMax`(), assumes there is $\zeta.$  Thus, the default does no integration.</p>-->
 
-<li>User-Contributed Elements of <code>MyModel</code> and <code>MyCode</code></li>
+<li >User-Contributed Elements of <code>MyModel</code> and <code>MyCode</code></li>
 <OL class="chapter">
-<LI>Utility()</LI>
+<LI id="utility">Utility()</LI>
 <code>MyModel</code> must supply a replacement for `Bellman::Utility`(). Since utility depends on the current state, the method must be automatic (not static).  Here is an example with one state variable and one action and how they might determine utility.
 <DD><pre>
 &#35;import "DDP"
@@ -63,7 +63,7 @@ So this is a model where $\alpha = (d)$ and $\theta = (s)$ and $U(\alpha;\theta)
 
 <p>As explained elsewhere, if <code>s</code> contains a state variable its "value" is not simply themselves. Likewise <code>a</code>. Their current values are retrieved by sending them to `CV`().  Also, note that $U()$ at a state is always treated as a vector-valued function in <span class="n">DDP</span> .  So <code>CV(d)</code> is a column vector.  As a state variable <code>s</code> is a scalar at $\theta$.</p>
 
-<LI>Reachable States</LI>
+<LI id="reachable">Reachable States</LI>
 
 A state is <em>unreachable</em> if it cannot occur given initial conditions.  For example, a person cannot have 20 years of labour market experience at age 18. Including unreachable states in the state space wastes computation and storage but does not cause any errors.</p>
 
@@ -161,7 +161,7 @@ When you call `DP::Initialize`() it opens a <em>timestamped</em> log file. Outpu
 
 </OL>
 
-@author &copy; 2011-2021 <a href="https://ferrall.github.io/">Christopher Ferrall</a></dd>
+@author &copy; 2011-2023 <a href="https://ferrall.github.io/">Christopher Ferrall</a></dd>
 
 <a name="auto"><hr><h1>Documentation of Items Defined in Bellman.ox <a href="#"><span class="skip"><abbr title=" Back to top">&nbsp;&#8679;&nbsp;</abbr></span></a></h1></a>
 
diff --git a/source/DDP/Clock.ox b/source/DDP/Clock.ox
index c69c96f9..e62577dc 100644
--- a/source/DDP/Clock.ox
+++ b/source/DDP/Clock.ox
@@ -1,7 +1,7 @@
 #ifndef Vh
     #include "Clock.h"
 #endif
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** .  **/
 TimeVariable::TimeVariable(L,N) { Coevolving(L,N); }
diff --git a/source/DDP/DDP.oxdoc b/source/DDP/DDP.oxdoc
index 7e7ab918..ecf33244 100644
--- a/source/DDP/DDP.oxdoc
+++ b/source/DDP/DDP.oxdoc
@@ -32,6 +32,6 @@
 
 <HR/>
 
-@author &copy; 2011-2021 <a href="https://ferrall.github.io/">Christopher Ferrall</a></dd>
+@author &copy; 2011-2023 <a href="https://ferrall.github.io/">Christopher Ferrall</a></dd>
 
 **/
diff --git a/source/DDP/DP.ox b/source/DDP/DP.ox
index 632953ed..2515389a 100644
--- a/source/DDP/DP.ox
+++ b/source/DDP/DP.ox
@@ -1,5 +1,5 @@
 #include "DP.h"
-/* This file is part of niqlow. Copyright (C) 2011-2021 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 
 /** Called by CreateSpaces.
diff --git a/source/DDP/Data.ox b/source/DDP/Data.ox
index 9948fabd..d21cf8f5 100644
--- a/source/DDP/Data.ox
+++ b/source/DDP/Data.ox
@@ -1,5 +1,5 @@
 #include "Data.h"
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 #ifndef Dox
     #define Dox
     #include "Outcomes.ox"
diff --git a/source/DDP/Data.oxdoc b/source/DDP/Data.oxdoc
index 7dab75b7..fc8d3974 100644
--- a/source/DDP/Data.oxdoc
+++ b/source/DDP/Data.oxdoc
@@ -308,7 +308,7 @@ The <a href="#Outcomes">Outcome</a> class is designed to work with realized resu
 </OL>
 
 </OL>
-@author &copy; 2011-2021 <a href="https://ferrall.github.io/">Christopher Ferrall</a></dd>
+@author &copy; 2011-2023 <a href="https://ferrall.github.io/">Christopher Ferrall</a></dd>
 
 <a name="auto"><hr><h1>Documentation of  Items Defined in Data.ox <a href="#"><span class="skip"><abbr title=" Back to top">&nbsp;&#8679;&nbsp;</abbr></span></a></h1></a>
 
diff --git a/source/DDP/HotzMiller.ox b/source/DDP/HotzMiller.ox
index 425b6bcc..412c46c0 100644
--- a/source/DDP/HotzMiller.ox
+++ b/source/DDP/HotzMiller.ox
@@ -1,7 +1,7 @@
 #ifndef Mh
     #include "HotzMiller.h"
 #endif
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** Create a Hotz-Miller solution method.
 @param (optional) indata  `Panel` object<br>F&times;1 array of Q mappings <br>0 [default], no data sent
diff --git a/source/DDP/ImaiJainChing.ox b/source/DDP/ImaiJainChing.ox
index 2af71c7d..f8246bc6 100644
--- a/source/DDP/ImaiJainChing.ox
+++ b/source/DDP/ImaiJainChing.ox
@@ -1,5 +1,5 @@
 #include "ImaiJainChing.h"
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 ImaiJainChing::Report() {
 	println("Metropolis-Hastings Design,"
diff --git a/source/DDP/Methods.ox b/source/DDP/Methods.ox
index 8f89692c..75ecd24e 100644
--- a/source/DDP/Methods.ox
+++ b/source/DDP/Methods.ox
@@ -1,5 +1,5 @@
 #include "Methods.h"
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 #ifndef Mox
     #define Mox
     #include "ValueIteration.ox"
diff --git a/source/DDP/Methods.oxdoc b/source/DDP/Methods.oxdoc
index 9c027c34..4f68e2dc 100644
--- a/source/DDP/Methods.oxdoc
+++ b/source/DDP/Methods.oxdoc
@@ -191,7 +191,7 @@ HM = new HotzMiller(data);
 </OL>
 
 </OL>
-@author &copy; 2011-2021 <a href="https://ferrall.github.io/">Christopher Ferrall</a></dd>
+@author &copy; 2011-2023 <a href="https://ferrall.github.io/">Christopher Ferrall</a></dd>
 <a name="auto"><hr><h1>Documentation of  Items Defined in Methods.ox <a href="#"><span class="skip"><abbr title=" Back to top">&nbsp;&#8679;&nbsp;</abbr></span></a></h1></a>
 
 **/
diff --git a/source/DDP/Outcomes.ox b/source/DDP/Outcomes.ox
index 0fbd94a6..f7ae78fb 100644
--- a/source/DDP/Outcomes.ox
+++ b/source/DDP/Outcomes.ox
@@ -1,7 +1,7 @@
 #ifndef Dh
     #include "Outcomes.h"
 #endif
-/* This file is part of niqlow. Copyright (C) 2011-2022 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /**  Simple Panel Simulation.
 @param Nsim  integer, number of paths to simulate per fixed group<br>[default] UseDefault, whic is 1
diff --git a/source/DDP/Predictions.ox b/source/DDP/Predictions.ox
index 072f562e..2d570fed 100644
--- a/source/DDP/Predictions.ox
+++ b/source/DDP/Predictions.ox
@@ -1,7 +1,7 @@
 #ifndef Dh
     #include "Predictions.h"
 #endif
-/* This file is part of niqlow. Copyright (C) 2011-2021 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /**  Simple Prediction .
 @param T	integer, length of panel<br>UseDefault [default], length of lifecycle or  10
diff --git a/source/DDP/ReservationValues.ox b/source/DDP/ReservationValues.ox
index 7a93ba81..24a71666 100644
--- a/source/DDP/ReservationValues.ox
+++ b/source/DDP/ReservationValues.ox
@@ -1,7 +1,7 @@
 #ifndef Mh
     #include "ReservationValues.h"
 #endif
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 
 /** Create a system of nonlinear equations to solve for reservation values.
diff --git a/source/DDP/SolveAsSystem.ox b/source/DDP/SolveAsSystem.ox
index 6dd007e1..42dc4356 100644
--- a/source/DDP/SolveAsSystem.ox
+++ b/source/DDP/SolveAsSystem.ox
@@ -1,7 +1,7 @@
 #ifndef Mh
     #include "SolveAsSystem.h"
 #endif
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** Initialize EV() as a system of non-linear equations. **/	
 EVSystem::EVSystem(spacesize,systask)		{
diff --git a/source/DDP/StateVariable.ox b/source/DDP/StateVariable.ox
index 654cd3d8..4012e47b 100644
--- a/source/DDP/StateVariable.ox
+++ b/source/DDP/StateVariable.ox
@@ -1,7 +1,7 @@
 #ifndef Vh
     #include "StateVariable.h"
 #endif
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** Remove all transitions for which the transition probability is EXACTLY 0. **/
 StripZeros(trans) {
@@ -93,10 +93,12 @@ the bequest value of the state.</DD>
 
 @comments The feasible action set for terminal states is automatically set to the first row of the gobal <var>A</var> matrix.
 @example
+<pre>
   s = new StateVariable("s",5);
   s->MakeTerminal(<3;4>);
   v = new StateVariable("v",1);
   v->MakeTerminal(1);
+</pre>
 </dd>
 
 Now any state for which <code>CV(s)=3</code> or <code>CV(s)=4</code> or <code>CV(v)=1</code>
@@ -832,7 +834,10 @@ Lagged::IsReachable() {
 @param Prune [optional default=TRUE] prune unreachable states automatically if finite horizon
 @param Order [optional default=1] order of the lag (how many periods to prune)
 
-@example <pre>prevoccup = new LaggedState("Prev",occup);</pre></DD>
+@example
+<pre>
+prevoccup = new LaggedState("Prev",occup);
+</pre></DD>
 
 @see DP::KLaggedState
 
@@ -852,8 +857,10 @@ LaggedState::Transit()	{
 @param L label
 @param Target `ActionVariable` to track.
 @param Prune TRUE [default]: prune non-zero states at t=0 if finite horizon detected.
-@param Order
-@example <pre>wrked = new LaggedAction("Worked Last Year",work);</pre>
+@param Order number of lags [default = 1]
+@example
+<pre>wrked = new LaggedAction("Worked Last Year",work);
+</pre></dd>
 
 @see DP::KLaggedAction
 **/
@@ -939,7 +946,9 @@ $$s' = \cases{ 0 & if CV(Target)==0\cr
 
 @example
 Once a person retires the stay retired forever:
-<pre>retired = new PermanentChoice("Ret",retire);</pre></dd>
+<pre>
+retired = new PermanentChoice("Ret",retire);
+</pre></dd>
 **/
 PermanentChoice::PermanentChoice(L,Target,Prune) {
 	LaggedAction(L,Target,Prune);
@@ -957,7 +966,8 @@ Once the Target is current in the ToTrack set this variable will be TRUE
 @param Target `CV`-compatible value to track.
 @param ToTrack vector of values to Track. Default=<1>.
 @param Prune.  Begins at 0 in finite horizon clocks.
-@example <pre>??</pre></dd>
+@example
+<pre>??</pre></dd>
 **/
 PermanentCondition::PermanentCondition(L,Target,ToTrack,Prune) {
     StateTracker(L,Target,ToTrack,Prune);
diff --git a/source/DDP/TimeInvariant.ox b/source/DDP/TimeInvariant.ox
index 6e5440b9..bb675a3b 100644
--- a/source/DDP/TimeInvariant.ox
+++ b/source/DDP/TimeInvariant.ox
@@ -1,7 +1,7 @@
 #ifndef Vh
     #include "TimeInvariant.h"
 #endif
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** A state variable that is non-random an invariant for and individual DP problem.
 
diff --git a/source/DDP/ValueIteration.ox b/source/DDP/ValueIteration.ox
index 167ca57f..e3b277d8 100644
--- a/source/DDP/ValueIteration.ox
+++ b/source/DDP/ValueIteration.ox
@@ -1,7 +1,7 @@
 #ifndef Mh
     #include "ValueIteration.h"
 #endif
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /**  All-in-one Value Iteration.
 
diff --git a/source/DDP/Variables.ox b/source/DDP/Variables.ox
index 6d13abf8..19e66ce3 100644
--- a/source/DDP/Variables.ox
+++ b/source/DDP/Variables.ox
@@ -1,5 +1,5 @@
 #include "Variables.h"
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 #ifndef Vox
     #define Vox
     #include "ActionVariable.ox"
diff --git a/source/DDP/Variables.oxdoc b/source/DDP/Variables.oxdoc
index d5e98a46..1f5c67fc 100644
--- a/source/DDP/Variables.oxdoc
+++ b/source/DDP/Variables.oxdoc
@@ -81,7 +81,7 @@ The three different approaches to coding discrete choices are illustrate in this
 <p>Indicator vectors make it possible to write any utility as a sum: $U = \sum_k d_k u_k$. But as with the single action approach the interpretation is not obvious and $U()$ will in no way resemble usual mathematical notation for an objective.</p>
 
 
-<LI>Actual, Current and Empirical Values of an Action Variable</LI>
+<LI id="AV">Actual, Current and Empirical Values of an Action Variable</LI>
 
 Usually an action variable can be an object of the base `ActionVariable` class.  The user rarely needs to define a derived class.
 
@@ -903,7 +903,7 @@ A continuous choice is related to <code>AuxiliaryValues</code>, in the sense tha
 
 </OL>
 
-@author &copy; 2011-2021 <a href="https://ferrall.github.io/">Christopher Ferrall</a> </dd>
+@author &copy; 2011-2023 <a href="https://ferrall.github.io/">Christopher Ferrall</a> </dd>
 
 <a id="auto"><hr><h1>Documentation of  Items Defined in Variables.ox <a href="#"><span class="skip"><abbr title=" Back to top">&nbsp;&#8679;&nbsp;</abbr></span></a></h1></a>
 
diff --git a/source/FiveO/Algorithms.ox b/source/FiveO/Algorithms.ox
index 6ea83f6c..e4026184 100644
--- a/source/FiveO/Algorithms.ox
+++ b/source/FiveO/Algorithms.ox
@@ -1,5 +1,5 @@
 #include "Algorithms.h"
-/* This file is part of niqlow. Copyright (C) 2011-2021 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** Base class for non-linear programming algorithms.
 @param O `Objective` to work on.
diff --git a/source/FiveO/Algorithms.oxdoc b/source/FiveO/Algorithms.oxdoc
index 14e8e421..d0e4d4fc 100644
--- a/source/FiveO/Algorithms.oxdoc
+++ b/source/FiveO/Algorithms.oxdoc
@@ -7,7 +7,7 @@ Algorithms are methods to optimize/solve a vector of parameters $(\psi)$ for eit
 
 See the FiveO <a href="hierarchy.html" target="_blank">class hierarchy</a> to see all the available algorithms.
 
-@author &copy; 2011-2021 <a href="https://ferrall.github.io/">Christopher Ferrall</a></dd>
+@author &copy; 2011-2023 <a href="https://ferrall.github.io/">Christopher Ferrall</a></dd>
 
 <a name="auto"><hr><h1>Documentation of  Items Defined in Algorithms.ox <a href="#"><span class="skip"><abbr title=" Back to top">&nbsp;&#8679;&nbsp;</abbr></span></a></h1></a>
 
diff --git a/source/FiveO/FiveO.ox b/source/FiveO/FiveO.ox
index de27fecc..f8a9041a 100644
--- a/source/FiveO/FiveO.ox
+++ b/source/FiveO/FiveO.ox
@@ -1,5 +1,5 @@
 #include "FiveO.h"
-/* This file is part of niqlow. Copyright (C) 2011-2021 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** Take a random walk in the parameter space of a model.
 @param model Object that has a <code>Solve()</code> method.
diff --git a/source/FiveO/FiveO.oxdoc b/source/FiveO/FiveO.oxdoc
index 06fa6ecb..1ef4985e 100644
--- a/source/FiveO/FiveO.oxdoc
+++ b/source/FiveO/FiveO.oxdoc
@@ -203,7 +203,7 @@ The routines in <code>maximize</code> are low level ones that leave a great deal
 <p>In <code>Modelbase</code> aspects of parameters are stored separately, at least from the user's perspective.  Parameters can be fixed or free, but other kinds of constraints and relationships between parameters are left to the user. A key difference with <span class="n">FiveO</span> is that parameters are represented as objects derived from built-in parameter types.  Parameters are created using a class that captures the constraints on the parameter and its relation to other parameters.  For example, with one line of code a user can add a vector of parameters that are guaranteed to be `Increasing` during optimization: <var>x<sub>1</sub> &gt;x<sub>2</sub> &gt; ··· &gt x<sub>M</sub>.
 </OL>
 
-@author &copy; 2011-2021 <a href="https://ferrall.github.io/">Christopher Ferrall</a>
+@author &copy; 2011-2023 <a href="https://ferrall.github.io/">Christopher Ferrall</a>
 </DD>
 
 **/
diff --git a/source/FiveO/Objective.ox b/source/FiveO/Objective.ox
index 2a42e6e8..8e9b1757 100644
--- a/source/FiveO/Objective.ox
+++ b/source/FiveO/Objective.ox
@@ -1,5 +1,5 @@
 #include "Objective.h"
-/* This file is part of niqlow. Copyright (C) 2011-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2011-2023 Christopher Ferrall */
 
 /** Checks the version number you send with the current version of niqlow.
 @param v integer [default=200]
diff --git a/source/FiveO/Parameters.ox b/source/FiveO/Parameters.ox
index fe2e6464..7b4010b8 100644
--- a/source/FiveO/Parameters.ox
+++ b/source/FiveO/Parameters.ox
@@ -1,5 +1,5 @@
 #include "Parameters.h"
-/* This file is part of niqlow. Copyright (C) 2012-2020 Christopher Ferrall */
+/* This file is part of niqlow. Copyright (C) 2012-2023 Christopher Ferrall */
 
 /**Create a fixed, pre-determined parameter.
 @param L string
diff --git a/source/niqlow.oxdoc b/source/niqlow.oxdoc
index 931eba25..dbb235e7 100644
--- a/source/niqlow.oxdoc
+++ b/source/niqlow.oxdoc
@@ -27,14 +27,14 @@ Browse and run <a  target="_blank" href="examples/default.html">test code, examp
 <LI>Build the mode using  the <a href="DDP/default.html">DDP</a> section of <span class="n">niqlow</span>.</LI>
 <LI>See a simple search model built using 7 executable statements in <a href="DDP/GetStarted.html">Get Started with DDP</a></LI>
 <LI><b>Or</b> start from scratch with <a href="DDP/DDP.ox.html">static discrete choice</a> and learn how to work up to a DP model.</LI>
-<LI><b>Or</b> follow replications of classic papers in  <a href="https://ferrall.github.io/OODP/">OODP</a> and start from the <a href="">replication code</a></LI>
+<LI><b>Or</b> follow replications of classic papers in  <a href="https://ferrall.github.io/OODP/">OODP</a> and start from the <a href="/examples/replications/default.html">replication code</a></LI>
 </UL>
 </td>
 
 <td><details class="over"><summary>Step 2. Solve the model</summary>
 <ul>
-<li>Use of the solution built in <a href="">Method</a>s to solve Bellman's equation for your model.</li>
-<li>Create <a href="">Data</a> outcomes for the solution.</td>
+<li>Use  <a href="DDP/Methods.ox.html">Method</a>s to solve Bellman's equation for your model and compute choice probabilities.</li>
+<li>Create <a href="DDP/Data.ox.html">Data</a> outcomes for the solution, either simulated data or (averaged) predictions.</td>
 </ul></details>
 <td><details class="over"><summary>Step 3. Find parameter values</summary>
 <UL><li>Use the integrated  <a href="FiveO/default.html">FiveO</a> tools to maximize an objective or solve a system of
@@ -47,29 +47,29 @@ equations that depends on the solved DP model.</li>
 
 <tr><td><details class="over"><summary>Required DP Components </summary>
     <UL>
-    <li><a href="DDP/">Choose among <a href="">Bellman</a> classes to base your template for each point $\theta$ of the state space.</a></li>
+    <li><a href="DDP/">Choose among derived <a href="/DDP/hierarchy.html">Bellman</a> classes to base your template for each point $\theta$ of the state space.</a></li>
      <li>Choose key/required features of $\theta$:</li>
-     <UL><li>Set the <a href="DDP/">Clock</a> (properties of $t$)</li>
-        <li>Add <a href="DDP/">Action Variables</a> to create your action vector $\alpha$.</li>
-        <li>Add <a href="DDP/">State Variables</a> to $\theta$, from which the model's transition emerges</li>
+     <UL><li>Set the <a href="DDP/Variables.ox.html#Clock">Clock</a> (properties of $t$)</li>
+        <li>Add <a href="DDP/Variables.ox.html#ActionVariables">Action Variables</a> to create your action vector $\alpha$.</li>
+        <li>Add <a href="DDP/Variables.ox.html#StateVariables">State Variables</a> to $\theta$, from which the model's transition emerges</li>
         </UL>
-     <li>Code <a href="">Utility()</a> </li>
-     <li>Set the <a href="">Discount Factor</a></li>
+     <li>Code <a href="DDP/Bellman.ox.html#utility">Utility()</a> </li>
+     <li>Set the discount factor &delta;</li>
      </UL></details><br/>
 <details class="over"><summary>Further customizations</summary>
      <ul>
-       <LI>Create multiple problems by adding <a href="DDP/">Group Variables</a></LI>
-       <li>Make values of state variables <a href="">Terminal Values</a></li>
-       <li>Restrict actions depending on $\theta$ by coding <a href="">FeasibleActions()</a> to define $A(\theta)$.</li>
-       <li>Restrict which states can be reached by coding <a href="">Reachable()</a></li>
-     <LI>Let <span class="n">niqlow</span> handle the mapping between discrete <a href="">counter values</a> of
-        variables and their <a href="">actual values</a> that enter your formulas</LI>
-     <LI>Set the point in the solution algorithm when transitions must be recomputed depending on the reliance on parameters or group variables
+       <LI>Create multiple problems by adding <a href="DDP/Variables.ox.html#Fixed">Group Variables</a></LI>
+       <li>Make values of state variables <a href="DDP/Variables.ox.html#StateVariable___MakeTerminal">Terminal Values</a></li>
+       <li>Restrict actions depending on $\theta$ by coding <a href="DDP/Bellman.ox.html#Bellman___FeasibleActions">FeasibleActions()</a> to define $A(\theta)$.</li>
+       <li>Restrict which states can be reached by coding <a href="DDP/Bellman.ox.html#reachable">Reachable()</a></li>
+     <LI>Let <span class="n">niqlow</span> handle the mapping between discrete <a href="DDP/Variables.ox.html#AV">counter values</a> of
+        variables and their <a href="DDP/Variables.ox.html#AV">actual values</a> that enter your formulas</LI>
+     <LI><a href="DDP/DP.ox.html#DP___SetUpdateTime">Set the point in the solution algorithm</a> when transitions must be recomputed depending on the reliance on parameters or group variables
         without computing the transitions unnecessarily.</LI>
      </ul></details><br/>
 <details class="over"><summary>When ready create the spaces</summary>
 <ul>
-  <li>As your code executes the model is built until you <a href="">CreateSpaces</a></li>
+  <li>As your code executes the model is built until you tell DDP to <code>CreateSpaces</code></li>
   <li><span class="n">DDP</span> will built your state space $\Theta$, the feasible action spaces $A(\theta)$ and the space of problems (group
     space $\Gamma$).</li>
   <li>Storage is economized by limiting storage at each point $\theta$ and relying heavily on shared (<em>static</em>) variables</li>
@@ -81,14 +81,14 @@ equations that depends on the solved DP model.</li>
     <UL>
     <LI>Solve for discrete choice probabilities (CCPs) under different assumptions or solve for reservation values of continuous
         random shocks.</LI>
-    <li>Apply the solution to your model using its <a href="">Solve()</a> function.</li>
+    <li>Apply the solution to your model using its <a href="/DDP/Methods.ox.html">Solve()</a> function.</li>
     <LI>Let the method handle storage and computation efficiently accounting for your clock and other details.</LI>
-    <LI>Create more than one method "object" and compare their performance</LI>
+    <LI>Create more than one method object to compare their performance</LI>
     </UL></details><br/>
 <details class="over"><summary>Create outcomes for the solved model</summary>
     <UL>
-    <LI>Create a <a href="">Panel</a> of outcomes so you can <a href="">Simulate</a> outcomes from the model <em>or</em> read in external data to compute likelihood .</LI>
-    <li>Create a <a href="">PanelPrediction</a> to <a href="">Predict</a> expected outcomes (averaged over all random elements) and read in
+    <LI>Create a <a href="/DDP/Data.ox.html#Outcomes">Panel</a> of outcomes so you can <a href="/DDP/Data.ox.html#Panel___Simulate">Simulate</a> outcomes from the model <em>or</em> read in external data to compute likelihood .</LI>
+    <li>Create a <a href="/DDP/Data.ox.html#PD">PanelPrediction</a> to <a href="/DDP/Data.ox.html#PanelPrediction___Predict">Predict</a> expected outcomes (averaged over all random elements) and read in
         external moments to compare them to.</li>
     <LI>Send a solution method to the data object: when any prediction or econometric calculation is needed the model will be resolved (a nested algorithm).</li>
     </UL>
@@ -113,17 +113,17 @@ equations that depends on the solved DP model.</li>
 <details class="over"><summary>Create a criterion (objective) </summary>
     <UL>
     <LI>Use an automatically generated econometric objective already available that depend on external data.</LI>
-    <LI>Create a system of equations to find <a href="">Equilibrium</a> prices.</LI>
+    <LI>Create a system of equations to find <a href="/FiveO/Objective.ox.html#Equilibrium">Equilibrium</a> prices.</LI>
     <LI>Add DP parameters to the objective/system so they are associated with it.</LI>
-    <LI>Use built-in features to handle <a href="">BHHH iteration</a> </LI>
-    <LI>Choose among GMM weighting options</LI>
+    <LI>Use built-in features to handle <a href="/FiveO/Algorithms.ox.html#BHHH">BHHH iteration</a> </LI>
+    <LI>Choose among <a href="/DDP/DDPShared.ox.html#GMMWeightOptions">GMM weighting options</a></LI>
     </UL>
 </details><br/>
 <details class="over"><summary>Optimize your objective.</summary>
-    <UL><li>Apply an <a href="">Algorithm(s)</a> using its <a href="">Iterate()</a> function.  </LI>
-    <LI>Apply different methods, monitor and <a href="">checkpoint</a> progress</LI>
+    <UL><li>Apply an <a href="/FiveO/hierarchy.html">Algorithm(s)</a> using its Iterate() function.  </LI>
+    <LI>Apply different methods, monitor and checkpoint progress</LI>
     <LI>Rest assured: the DP model is re-solved each time the criterion is re-evaluated because you sent the solution method to the data objects.</LI>
-    <LI>Turn DP iteration on and off in order to carry out <a href="">Two-Stage Estimation.</a></LI>
+    <LI>Turn DP iteration on and off in order to carry out <a href="/FiveO/Objective.ox.html#DataObjective___TwoStage">Two-Stage Estimation.</a></LI>
     </UL></details><br/></td></td></tr>
 
 <tr><th colspan="3"  class="sep">When your model &hellip;</th></tr>
