#
# Parameters for this run
#
targetInputFile tiInputTargetsChunk69.fit
targetOutputFile tiOutputFinalChunk69.fit
tileOutputFile tileFullChunk69.par
seed 52240
firstTile 1047
tileRun 69
 
#
# Uniform tiling to start with
#
tilingBoundary tilingBoundaryChunk69.par
oddOffset -1.
ignoreCover 0
uniformTiling sort
nTilesSphere 7682
 
#
# OPDB Parameters
#
parameters tiParam.par
parametersDir .
inputFile tiInputOPDBChunk69.fit
outputFile tiOutputOPDBChunk69.fit
outputTCFile tileOPDBChunk69.par
tileType survey
inputDir .
outputDir .
 
#
# Conditions to Satisfy
#
desCoverage                 0.99     # Min fraction of targets to tile
desCoverageResolved         0.0      # Min fraction of collisions to recover

#
# tileSearchFudge: 
#   if >0 : Use a binary search to find smallest number of tiles which 
#           satisfy conditions above; use this value to set initial search 
#           range (1.05 or 1.1 is fine in this case)
#   if <0 : Use the absolute value to set the number of tiles to use by 
#           hand (e.g. -44 means use exactly 44 tiles). 
#
# For both of these cases, the number of tiles set is set *before* trimming.
# That is, the edgeTrim and fractionTrim stuff is applied *after* the 
# binary search, or after 44 tiles are allocated.
#
#tileSearchFudge 1.05  
tileSearchFudge -17

#
# Other Parameters
#
maxTileIter 50        # how many iterations of cost minimization?
moveLimit 0.002       # stop if max movement of any tile is < this (degrees)
toSurveyCoords 1      # convert to survey coords 
edgeTrim 0.        # after solution, trim tiles this close to edge (degrees)
fractionTrim -0.5  # trim tiles with < this fraction of allocated fibers
retainDecollided 1