void CSpiel::start_new_game(GAMEMODE gamemode){
init_field();
set_seeds(gamemode);
for (int n = 0; n < PLAYER_MAX; n++){
CSpiel::m_player[n].init(this, n);
}
}
void CSpiel::undo_turn(CTurnpool* turnpool, GAMEMODE gamemode){
CTurn* turn = turnpool->get_last_turn();
CStone* stone = CSpiel::m_player[turn->get_playernumber()].get_stone(turn->get_stone_number());
int x, y;
stone->mirror_rotate_to(turn->get_mirror_count(), turn->get_rotate_count());
#ifdef _DEBUG
//check valid
if (turn == NULL) error_exit("Kein turn", 42);
for (x = 0; x < stone->get_stone_size(); x++){
for (y = 0; y < stone->get_stone_size(); y++){
if (stone->get_stone_field(y, x) != STONE_FIELD_FREE){
if (CSpiel::get_game_field(turn->get_y() + y, turn->get_x() + x) != turn->get_playernumber()) {
printf("y: %d, x: %d\n", turn->get_y() + y, turn->get_x() +x);
error_exit("�bergebener Turnpool fehlerhaft (undo turn)", 44);//return false;
}
}
}
}
#endif
//delete stone
for (x = 0; x < stone->get_stone_size(); x++){
for (y = 0; y < stone->get_stone_size(); y++){
if (stone->get_stone_field(y, x) != STONE_FIELD_FREE){
CSpiel::free_gamefield(turn->get_y() + y, turn->get_x() + x);
}
}
}
//redraw gamefield
for (x = 0; x < CSpiel::get_field_size_x(); x++){
for (y = 0; y < CSpiel::get_field_size_y(); y++){
if (CSpiel::get_game_field(y, x) == FIELD_FREE ){
CSpiel::free_gamefield(y, x);
}
}
}
for (x = 0; x < CSpiel::get_field_size_x(); x++){
for (y = 0; y < CSpiel::get_field_size_y(); y++){
if (CSpiel::get_game_field(y, x) != FIELD_FREE ){
CSpiel::set_single_stone_for_player(CSpiel::get_game_field(y, x), y, x);
}
}
}
set_seeds(gamemode);
stone->available_increment();
refresh_player_data();
//end redraw
turnpool->delete_last();
}
void pv_fitting(char basename[1024], int exists, exp_data * sync_data, peak_data * difra, double * intens, double ** seeds)
{
//printf("pv_fitting start\n");
//auxiliary variables
char filename[500];
FILE *fp;
int i, j, n, bad_fit, zero_peak_index[difra->numrings];
// Remove peaks with intensity below the treshold
int n_peaks = check_for_null_peaks(difra->treshold, difra->numrings, zero_peak_index, intens);
double t0[n_peaks], I0[n_peaks], shift_H[n_peaks], shift_eta[n_peaks];
int seeds_size = 4 * n_peaks + 2, all_seeds_size = 4 * difra->numrings + 2;
int ptrn_start = theta2bin(difra->bg[0][0], sync_data->pixel, sync_data->dist);
int ptrn_end = theta2bin(difra->bg[0][difra->n_bg - 1], sync_data->pixel, sync_data->dist);
int net_size = ptrn_end - ptrn_start;
// Set the vector with the seeds for the fitting
double ** peak_seeds = matrix_double_alloc(2, seeds_size), *fit_errors = vector_double_alloc(seeds_size);
memset(fit_errors, 0, seeds_size * sizeof(double));
set_seeds(all_seeds_size, zero_peak_index, exists, seeds, peak_seeds);
// Number of parameters to fit
int n_param[4] = {2 * n_peaks + 1 + difra->n_bg, 3 * n_peaks + difra->n_bg, 2 * n_peaks + 2 + difra->n_bg, 4 * n_peaks + difra->n_bg};
// Fixed parameters
gsl_vector * ttheta = gsl_vector_alloc(net_size); // 2theta
gsl_vector * y = gsl_vector_alloc(net_size); // counts of the pattern
gsl_vector * sigma = gsl_vector_alloc(net_size); // count error
gsl_vector * bg_pos = gsl_vector_alloc(difra->n_bg); // background points
//printf("Getting data\n");
j = 0;
for(i = ptrn_start; i < ptrn_end; i++){
gsl_vector_set(ttheta, j, bin2theta(i, sync_data->pixel, sync_data->dist));// convert from bin to 2theta
gsl_vector_set(y, j, difra->intensity[i]); // set inensities
gsl_vector_set(sigma, j, sqrt(difra->intensity[i])); // the error of the intensities is the square root
j++;
}
for(i = 0; i < difra->n_bg; i++)
gsl_vector_set(bg_pos, i, difra->bg[0][i]);
struct data d = {net_size, n_peaks, difra->n_bg, ttheta, y, sigma, bg_pos}; // structure with the experimental data
// Logfile with the input and output seeds
char fitlogname[1024];
sprintf(fitlogname, "%sfit_results.log", sync_data->root_name);
FILE * fp_logfile = fopen(fitlogname, "a");
fprintf(fp_logfile, "spr: %d gamma: %d (p%d)\nStarting values\n", difra->spr, difra->gamma, difra->npattern);
print_seeds2file(fp_logfile, peak_seeds[exists], fit_errors, seeds_size, difra->bg, difra->n_bg);
//printf("Start interations\n");
//printf("Step 1\n");
//print_seeds(peak_seeds[exists], seeds_size, difra->bg, difra->n_bg);
pv_step1(exists, peak_seeds, seeds_size, difra->bg, &d, n_param[0]);
//print_seeds(peak_seeds[1], seeds_size, difra->bg, difra->n_bg);
check(y, peak_seeds, seeds_size, n_peaks, difra->bg, difra->n_bg);
//printf("Step 2\n");
//print_seeds(peak_seeds[1], seeds_size, difra->bg, difra->n_bg);
pv_step2(exists, peak_seeds, seeds_size, difra->bg, &d, n_param[1]);
//print_seeds(peak_seeds[1], seeds_size, difra->bg, difra->n_bg);
check(y, peak_seeds, seeds_size, n_peaks, difra->bg, difra->n_bg);
//printf("Step 3\n");
//print_seeds(peak_seeds[1], seeds_size, difra->bg, difra->n_bg);
pv_step3(exists, peak_seeds, fit_errors, seeds_size, difra->bg, &d, n_param[2]);
//print_seeds(peak_seeds[1], seeds_size, difra->bg, difra->n_bg);
check(y, peak_seeds, seeds_size, n_peaks, difra->bg, difra->n_bg);
//printf("Step 4\n");
//print_seeds(peak_seeds[1], seeds_size, difra->bg, difra->n_bg);
pv_step4(exists, peak_seeds, fit_errors, seeds_size, difra->bg, &d, n_param[3]);
//print_seeds(peak_seeds[1], seeds_size, difra->bg, difra->n_bg);
//printf("End of iterations\n");
//Print the result of the fitting in fp_logfile
fprintf(fp_logfile, "Final values\n");
print_seeds2file(fp_logfile, peak_seeds[1], fit_errors, seeds_size, difra->bg, difra->n_bg);
fflush(fp_logfile);
fclose(fp_logfile);
//printf("Correction and output of the results\n");
sprintf(filename, "%s%sspr_%d_pattern_%d.dat", sync_data->path_out, sync_data->root_name, difra->spr, difra->gamma);
if((fp = fopen(filename, "w")) == NULL)
{
fprintf(stderr, "Error opening file %s\n", filename);
exit(1);
}
for(i = 0; i < net_size; i++)
if(gsl_vector_get(y, i))
fprintf(fp, "%.5lf %.5lf\n", gsl_vector_get(ttheta, i), gsl_vector_get(y, i));
else
fprintf(fp, "%.5lf %.5lf\n", gsl_vector_get(ttheta, i), 1.0);
fflush(fp);
fclose(fp);
//imprimo las posiciones de los picos y sus intensidades
sprintf(filename, "%s%sspr_%d_pattern_%d.peak-index.dat", sync_data->path_out, sync_data->root_name, difra->spr, difra->gamma);
if((fp = fopen(filename, "w")) == NULL)
{
fprintf(stderr, "Error opening file %s\n", filename);
exit(1);
}
n = 0;
for(i = 2; i < seeds_size; i += 4)
{
t0[n] = peak_seeds[1][i];
I0[n] = peak_seeds[1][i + 1];
shift_H[n] = peak_seeds[1][i + 2];
shift_eta[n] = peak_seeds[1][i + 3];
n++;
}
n = 2;
for(i = 0; i < difra->numrings; i++)
{
if(zero_peak_index[i] == 0)
{
double theta = peak_seeds[1][n], H = peak_seeds[1][0], eta = peak_seeds[1][1];
double I = pseudo_voigt(theta, n_peaks, I0, t0, H, eta, shift_H, shift_eta, difra->n_bg, bg_pos, difra->bg[1]);
fprintf(fp, "%.5lf %.5lf %d %d\n", peak_seeds[1][n], I, difra->hkl[i], difra->ph[i]);
n += 4;
}
}
fflush(fp);
fclose(fp);
//imprimo las posiciones y las intensidades de los puntos de background
sprintf(filename, "%s%sspr_%d_pattern_%d.bg-spline.dat", sync_data->path_out, sync_data->root_name, difra->spr, difra->gamma);
if((fp = fopen(filename, "w")) == NULL)
{
fprintf(stderr, "Error opening file %s\n", filename);
exit(1);
}
for(i = 0; i < difra->n_bg; i++)
fprintf(fp, "%.5lf %.5lf\n", difra->bg[0][i], difra->bg[1][i]);
fflush(fp);
fclose(fp);
//se puede analizar la posibilidad de usar una cubic spline en vez de una lineal para este programa
//ya que el propio cmwp va a usar una cubic spline
bad_fit = fit_result(all_seeds_size, peak_seeds, fit_errors, zero_peak_index, sync_data, difra);
if(bad_fit) check(y, peak_seeds, seeds_size, n_peaks, difra->bg, difra->n_bg);
set_seeds_back(all_seeds_size, zero_peak_index, exists, seeds, peak_seeds);
//liberacion de memoria allocada
gsl_vector_free(ttheta);
gsl_vector_free(y);
gsl_vector_free(sigma);
gsl_vector_free(bg_pos);
free_double_matrix(peak_seeds, 2);
free(fit_errors);
// printf("Fin pv_fitting\n");
}