Coord Solver::advise(BaseField &field, float &probability)
{
Coord point;
probability = 1;
delete d->facts;
d->facts = new AdviseFast::FactSet(&field);
delete d->rules;
d->rules = new AdviseFast::RuleSet(d->facts);
if( AdviseFast::adviseFast(&point, d->facts, d->rules) ) return point;
CoordSet surePoints;
AdviseFull::ProbabilityMap probabilities;
AdviseFull::adviseFull(d->facts, &surePoints, &probabilities);
// return one of the sure point (random choice to limit the tropism) [NH]
if( !surePoints.empty() ) {
KRandomSequence r;
uint k = r.getLong(surePoints.size());
CoordSet::iterator it = surePoints.begin();
for (uint i=0; i<k; i++) ++it;
return *it;
}
// Just a minimum probability logic here
if( !probabilities.empty() ) {
probability = probabilities.begin()->first;
return probabilities.begin()->second;
}
// Otherwise the Field is already solved :)
return Coord(-1,-1);
}
void AdviseFull::EquationSet::normalize()
{
short i=0;
set<short> empty;
for(i=0; i<_maxPointSet; ++i){
if(!_pointSets.count(i)) continue;
if(_pointSets[i].empty()){
this->substitute(i, empty);
continue;
}
for(short j=i+1;j<_maxPointSet; ++j){
if(!_pointSets.count(j)) continue;
if(_pointSets[j].empty()){
this->substitute(j, empty);
continue;
}
CoordSet intersect;
set_intersection(
_pointSets[i].begin(),
_pointSets[i].end(),
_pointSets[j].begin(),
_pointSets[j].end(),
inserter(intersect, intersect.begin()));
if(intersect.empty()) continue;
CoordSet _i, _j;
set_difference(
_pointSets[i].begin(),
_pointSets[i].end(),
_pointSets[j].begin(),
_pointSets[j].end(),
inserter(_i, _i.begin()));
set_difference(
_pointSets[j].begin(),
_pointSets[j].end(),
_pointSets[i].begin(),
_pointSets[i].end(),
inserter(_j, _j.begin()));
set<short> _ip, _jp;
_ip.insert(_maxPointSet);
_jp.insert(_maxPointSet);
_pointSets[_maxPointSet++] = intersect;
_ip.insert(_maxPointSet);
_pointSets[_maxPointSet++] = _i;
_jp.insert(_maxPointSet);
_pointSets[_maxPointSet++] = _j;
this->substitute(i, _ip);
this->substitute(j, _jp);
break;
}
}
}
bool Solver::solveStep()
{
if ( _field->isSolved() ) {
emit solvingDone(true);
return true;
}
d->rules->solve();
#ifdef DEBUG
PRINT_ELAPSED("fast rules")
#endif
if( _field->isSolved() ) {
emit solvingDone(true);
return true;
}
CoordSet surePoints;
AdviseFull::ProbabilityMap probabilities;
AdviseFull::adviseFull(d->facts, &surePoints, &probabilities);
#ifdef DEBUG
PRINT_ELAPSED("full rules")
#endif
if(!surePoints.empty()) {
CoordSet::iterator i;
for(i=surePoints.begin(); i!=surePoints.end(); ++i) {
bool b = d->rules->reveal(*i);
assert(b);
}
} else if ( !_noGuess ) {
#ifdef DEBUG
cout << "Applying heuristics!" << endl;
cout << *_field << endl;
#endif
// Minimum probability logic
assert(!probabilities.empty());
#ifdef DEBUG
AdviseFull::ProbabilityMap::iterator i=probabilities.begin();
cout << "Probability is " << i->first << endl;
#endif
bool success = d->rules->reveal(probabilities.begin()->second);
if ( !success ) {
emit solvingDone(false);
return false;
}
}
if (_inOneStep) return solveStep();
else QTimer::singleShot(0, this, SLOT(solveStep()));
return false;
}
