void GeneticClass::showBest(){ int dnaLength = printBest(); double procent = (100.0 * bestScoreInAll) / (Loader::maxUsed); cout << endl << "Uzyskany najlepszy wynik: " << bestScoreInAll << endl; cout << "Uzyskana dlugosc DNA: " << dnaLength << endl; cout << "Uzyskany procent: " << procent << "% " << endl; cout << "-------------------------------" << endl << endl; Saver::dnaLength = dnaLength; Saver::result = bestScoreInAll; }
int search(Board b, int maxDepth, int m, int n) { searchNode* head = new searchNode(b); nodeCounter = 0; std::cout << "\n** R.Reti Endgame Board **\n"; head->printBoardImage(); int topHeurisic = _search(head,maxDepth,0,UNSET); printTree(head,m,n); printBest(head); return topHeurisic; }