C | C++ 알고리즘 & 자료구조
814-2 도전 - 1
namespace Simulated_Annealing{ // int GEN_CYCLE = 1000; // for genetic algorithm int max_score; double t = 1; double d = 0.9995; double k = 2.5; double lim = 0.05; vector2 max_board(8,vector1(14,0)); vector2 now_board(8,vector1(14,0)); void Start(){ int nwscore=scoring(now_board),prevscore,cnt=0; vector2 prev_board; while(t>lim){ prevscore=nwscore; //Todo : change state 1 to 2 /*****************..
