*Note: unless registered, ChessU3 is a King's Indian Def./Gruenfeld Def.
       demo only (1.d4 Nf6). Download such games or use your database or
       ChessU4 to select them out of larger collections. (Other opening
       collections such as the QID, Benoni, or Benko gambit _might_ work.)

	Sample ChessU4 search:

		> f*		(find and save to a file)
		> 1.d4 Nf6	(search string)

			*OR*

		> f*
		> <ECO "D7>,<ECO "D8>,<ECO "D9>		(Gruenfeld search)

		> f*
		> <ECO "E6>,<ECO "E7>,<ECO "E8>,<ECO "E9>     (KID search)

	The position search feature of ChessU4 can also be used.

	To run with the KID test file, Trial.txt (which has a rather deep
        line), a good range setting is "40,5".


Instructions for using the ChessU3 Tree Searcher
================================================

	- run on a relatively small file with games of a single opening

	- 2000 games can be read but only at a shallow depth; 24 halfmoves
	  are usually accepted by a collection of 500 games provided they
	  represent a single opening. Narrow larger collections with ChessU4
	  or by selecting and printing to a file with your database.

	- the games should not be annotated with bracketed comments (such
	  comments can be removed with NORMAL.exe)

	- halfmove depth determines how deeply the games will be
	  analyzed

	- minimum games for rating determines the farthest point at the
	  end of each tree branch that can be considered adequate to
	  begin mini-max backsolving to determine the rating of a line.
	  An input value of 5 could result in values passed back from
	  +5.00 (good for White) to -5.00 (good for Black). A value of
	  +5.00 would mean that White won 5 out of 5 games at the end
	  of the specified line in the tree.

	- enter H (help) at a candidate's menu prompt for other options

	- Version 3.1 now has mark and jump options. A jump can only be
	  made to a previously marked position and the jump must always
	  be in a backwards direction.

	- ChessU3 can handle roughly 6000 positions or move transitions.
	  If the numbers are exceeded, try reducing the halfmove depth
	  or reduce the size of the collection.

	- ChessU3 creates lines for ChessU4 position searches. Going in
	  the opposite direction, it is also handy to run ChessU4 first,
	  preselecting games across multiple game files for ChessU3.

	- PGN (Portable Game Notation) ASCII chess files work best but
	  ChessU3 may be able to read other formats as well. A test on a
	  few games is a good way to find out.

	- ChessU3 will repeat analysis when it encounters a game with
	  repeating moves. With certain openings--especially at a deep
	  halfmove depth--you may think that U3 has gone into a loop.
	  Be patient--it will eventually find its way out.

	- Repeats and loops can sometimes involve several games. If 
	  diagnosed game numbers are mixed (eg, /#11 #11 #128 #11/), it
	  is usually the second to last game listed that is causing the
	  problem.

Suggestion: If you have a line you are interested in--or one that has
	  been saved to GamesU4.txt--place it as the TOP game in the PGN
	  collection you are reading with ChessU3. This will cause the
	  line to appear first in each candidate's menu--so long as the
	  line is followed.

	  Once you have worked out a "repertoire" with PERTO, keep a copy
	  of the "Line Report" handy. Mark all terminators of your
	  chosen line(s) (the longest) with "1-0" or "0-1" terminators (as
	  appropriate). Run ChessU3 at something like "45,1" on the Line
	  Report. This can serve as a reminder of reasonable candidates
	  and also for the times one gets lost in an intricate opening.
	  (To review your repertoire, use reader ChessU4.)

Footnote: In some ways it is rather unfortunate to have to call ChessU3
	  a "tree-searcher." Chess is not a "tree" problem (as it is
	  treated by the databases). Rather, a better analogy would
	  be a delta, such as the Nile, which has many tributaries...
	  splitting....then flowing back together again.


  -Paul 	70641.3236@compuserve.com