static T g <T>(TechniqueSearcher s, string p) => (T)s.GetType().GetProperty(p) !.GetValue(null) !;
/// <summary>
/// Solve naively.
/// </summary>
/// <param name="grid">The grid.</param>
/// <param name="cloneation">The cloneation grid to calculate.</param>
/// <param name="steps">All steps found.</param>
/// <param name="solution">The solution.</param>
/// <param name="sukaku">Indicates whether the current mode is sukaku.</param>
/// <returns>The analysis result.</returns>
/// <exception cref="WrongHandlingException">
/// Throws when the solver cannot solved due to wrong handling.
/// </exception>
private AnalysisResult SolveNaively(
IReadOnlyGrid grid, Grid cloneation, List <TechniqueInfo> steps, IReadOnlyGrid solution, bool sukaku)
{
// Check symmetry first.
if (!sukaku && CheckGurthSymmetricalPlacement)
{
var symmetrySearcher = new GspTechniqueSearcher();
var tempStep = symmetrySearcher.GetOne(cloneation);
if (!(tempStep is null))
{
if (CheckConclusionsValidity(solution, tempStep.Conclusions))
{
tempStep.ApplyTo(cloneation);
steps.Add(tempStep);
goto Label_Searching;
}
else
{
throw new WrongHandlingException(grid);
}
}
}
Label_Searching:
// Start searching.
var searchers = new TechniqueSearcher[]
{
new SingleTechniqueSearcher(EnableFullHouse, EnableLastDigit),
new LcTechniqueSearcher(),
new SubsetTechniqueSearcher(),
new NormalFishTechniqueSearcher(),
new RegularWingTechniqueSearcher(CheckRegularWingSize),
new IrregularWingTechniqueSearcher(),
new TwoStrongLinksTechniqueSearcher(),
new UrTechniqueSearcher(CheckIncompletedUniquenessPatterns, SearchExtendedUniqueRectangles),
new XrTechniqueSearcher(),
new UlTechniqueSearcher(),
new EmptyRectangleTechniqueSearcher(),
new AlcTechniqueSearcher(CheckAlmostLockedQuadruple),
new SdcTechniqueSearcher(AllowOverlappingAlses, AlsHighlightRegionInsteadOfCell, AllowAlsCycles),
new BdpTechniqueSearcher(),
new BugTechniqueSearcher(UseExtendedBugSearcher),
new ErIntersectionPairTechniqueSearcher(),
new AlsXzTechniqueSearcher(AllowOverlappingAlses, AlsHighlightRegionInsteadOfCell, AllowAlsCycles),
new AlsXyWingTechniqueSearcher(AllowOverlappingAlses, AlsHighlightRegionInsteadOfCell, AllowAlsCycles),
new AlsWWingTechniqueSearcher(AllowOverlappingAlses, AlsHighlightRegionInsteadOfCell, AllowAlsCycles),
new DeathBlossomTechniqueSearcher(
AllowOverlappingAlses, AlsHighlightRegionInsteadOfCell, MaxPetalsOfDeathBlossom),
new GroupedAicTechniqueSearcher(
true, false, false, AicMaximumLength, ReductDifferentPathAic,
OnlySaveShortestPathAic, CheckHeadCollision, CheckContinuousNiceLoop),
new GroupedAicTechniqueSearcher(
false, true, false, AicMaximumLength, ReductDifferentPathAic,
OnlySaveShortestPathAic, CheckHeadCollision, CheckContinuousNiceLoop),
new GroupedAicTechniqueSearcher(
false, false, true, AicMaximumLength, ReductDifferentPathAic,
OnlySaveShortestPathAic, CheckHeadCollision, CheckContinuousNiceLoop),
new HobiwanFishTechniqueSearcher(
HobiwanFishMaximumSize, HobiwanFishMaximumExofinsCount,
HobiwanFishMaximumEndofinsCount, HobiwanFishCheckTemplates),
new JuniorExocetTechniqueSearcher(CheckAdvancedInExocet),
new SeniorExocetTechniqueSearcher(CheckAdvancedInExocet),
new SkLoopTechniqueSearcher(),
new PomTechniqueSearcher(),
new BowmanBingoTechniqueSearcher(BowmanBingoMaximumLength),
new TemplateTechniqueSearcher(OnlyRecordTemplateDelete),
new CccTechniqueSearcher(),
new AlsNetTechniqueSearcher(),
new BruteForceTechniqueSearcher(solution),
};
/// <summary>
/// Solve the puzzle with <see cref="AnalyzeDifficultyStrictly"/> option.
/// </summary>
/// <param name="grid">The grid.</param>
/// <param name="cloneation">The cloneation grid to calculate.</param>
/// <param name="steps">All steps found.</param>
/// <param name="solution">The solution.</param>
/// <param name="sukaku">Indicates whether the current mode is sukaku mode.</param>
/// <returns>The analysis result.</returns>
/// <exception cref="WrongHandlingException">
/// Throws when the solver cannot solved due to wrong handling.
/// </exception>
private AnalysisResult SolveWithStrictDifficultyRating(
IReadOnlyGrid grid, Grid cloneation, List <TechniqueInfo> steps, IReadOnlyGrid solution, bool sukaku)
{
var searchers = new TechniqueSearcher[][]
{
new[] { new SingleTechniqueSearcher(EnableFullHouse, EnableLastDigit) },
new[] { new LcTechniqueSearcher() },
new TechniqueSearcher[]
{
new SubsetTechniqueSearcher(),
new NormalFishTechniqueSearcher(),
new RegularWingTechniqueSearcher(CheckRegularWingSize),
new IrregularWingTechniqueSearcher(),
new TwoStrongLinksTechniqueSearcher(),
new UrTechniqueSearcher(CheckIncompletedUniquenessPatterns, SearchExtendedUniqueRectangles),
new XrTechniqueSearcher(),
new UlTechniqueSearcher(),
new EmptyRectangleTechniqueSearcher(),
new AlcTechniqueSearcher(CheckAlmostLockedQuadruple),
new SdcTechniqueSearcher(AllowOverlappingAlses, AlsHighlightRegionInsteadOfCell, AllowAlsCycles),
new BdpTechniqueSearcher(),
new BugTechniqueSearcher(UseExtendedBugSearcher),
new ErIntersectionPairTechniqueSearcher(),
new AlsXzTechniqueSearcher(AllowOverlappingAlses, AlsHighlightRegionInsteadOfCell, AllowAlsCycles),
new AlsXyWingTechniqueSearcher(
AllowOverlappingAlses, AlsHighlightRegionInsteadOfCell, AllowAlsCycles),
new AlsWWingTechniqueSearcher(AllowOverlappingAlses, AlsHighlightRegionInsteadOfCell, AllowAlsCycles),
new GroupedAicTechniqueSearcher(
true, false, false, AicMaximumLength, ReductDifferentPathAic,
OnlySaveShortestPathAic, CheckHeadCollision, CheckContinuousNiceLoop),
new GroupedAicTechniqueSearcher(
false, true, false, AicMaximumLength, ReductDifferentPathAic,
OnlySaveShortestPathAic, CheckHeadCollision, CheckContinuousNiceLoop),
new GroupedAicTechniqueSearcher(
false, false, true, AicMaximumLength, ReductDifferentPathAic,
OnlySaveShortestPathAic, CheckHeadCollision, CheckContinuousNiceLoop),
},
new TechniqueSearcher[]
{
new BowmanBingoTechniqueSearcher(BowmanBingoMaximumLength),
new DeathBlossomTechniqueSearcher(
AllowOverlappingAlses, AlsHighlightRegionInsteadOfCell, MaxPetalsOfDeathBlossom),
new HobiwanFishTechniqueSearcher(
HobiwanFishMaximumSize, HobiwanFishMaximumExofinsCount,
HobiwanFishMaximumEndofinsCount, HobiwanFishCheckTemplates),
new PomTechniqueSearcher(),
new TemplateTechniqueSearcher(OnlyRecordTemplateDelete),
},
new TechniqueSearcher[]
{
new CccTechniqueSearcher(),
new JuniorExocetTechniqueSearcher(CheckAdvancedInExocet),
new SeniorExocetTechniqueSearcher(CheckAdvancedInExocet),
new SkLoopTechniqueSearcher(),
new AlsNetTechniqueSearcher(),
},
new[] { new BruteForceTechniqueSearcher(solution) }
};
var stepGrids = new Bag <IReadOnlyGrid>();
var bag = new Bag <TechniqueInfo>();
var stopwatch = new Stopwatch();
stopwatch.Start();
Label_Restart:
TechniqueSearcher.InitializeMaps(cloneation);
for (int i = 0, length = searchers.Length; i < length; i++)
{
var searcherListGroup = searchers[i];
foreach (var searcher in searcherListGroup)
{
if (sukaku is true && searcher is UniquenessTechniqueSearcher)
{
// Sukaku mode cannot use them.
// In fact, sukaku can use uniqueness tests, however the program should
// produce a large modification.
continue;
}
if (!(bool)searcher.GetType().GetProperty("IsEnabled") !.GetValue(null) !)
{
// Skip the technique when the static property 'IsEnabled' is set false.
continue;
}
if (EnableGarbageCollectionForcedly &&
searcher.HasMarked <TechniqueSearcher, HighAllocationAttribute>(out _))
{
GC.Collect();
}
searcher.GetAll(bag, cloneation);
}
if (bag.None())
{
continue;
}
if (FastSearch)
{
decimal minDiff = bag.Min(info => info.Difficulty);
var selection = from info in bag where info.Difficulty == minDiff select info;
if (selection.None())
{
continue;
}
if (!CheckConclusionValidityAfterSearched ||
selection.All(info => CheckConclusionsValidity(solution, info.Conclusions)))
{
foreach (var step in selection)
{
if (RecordTechnique(steps, step, grid, cloneation, stopwatch, stepGrids, out var result))
{
stopwatch.Stop();
return(result);
}
}
// The puzzle has not been finished,
// we should turn to the first step finder
// to continue solving puzzle.
bag.Clear();
goto Label_Restart;
}
else
{
TechniqueInfo?wrongStep = null;
foreach (var step in selection)
{
if (!CheckConclusionsValidity(solution, step.Conclusions))
{
wrongStep = step;
break;
}
}
throw new WrongHandlingException(grid, $"The specified step is wrong: {wrongStep}.");
}
}
else
{
var step = bag.GetElementByMinSelector(info => info.Difficulty);
if (step is null)
{
// If current step cannot find any steps,
// we will turn to the next step finder to
// continue solving puzzle.
continue;
}
if (!CheckConclusionValidityAfterSearched || CheckConclusionsValidity(solution, step.Conclusions))
{
if (RecordTechnique(steps, step, grid, cloneation, stopwatch, stepGrids, out var result))
{
// The puzzle has been solved.
// :)
stopwatch.Stop();
return(result);
}
else
{
// The puzzle has not been finished,
// we should turn to the first step finder
// to continue solving puzzle.
bag.Clear();
goto Label_Restart;
}
}
else
{
throw new WrongHandlingException(grid, $"The specified step is wrong: {step}.");
}
}
}
// All solver cannot finish the puzzle...
// :(
stopwatch.Stop();
return(new AnalysisResult(
puzzle: grid,
solverName: SolverName,
hasSolved: false,
solution: null,
elapsedTime: stopwatch.Elapsed,
solvingList: steps,
additional: null,
stepGrids));
}
