-
Notifications
You must be signed in to change notification settings - Fork 13
/
Copy pathrtngcalc.c
130 lines (101 loc) · 2.58 KB
/
rtngcalc.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
/*
Ordo is program for calculating ratings of engine or chess players
Copyright 2013 Miguel A. Ballicora
This file is part of Ordo.
Ordo is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Ordo is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with Ordo. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "mymem.h"
#include "rating.h"
#include "ratingb.h"
#include "encount.h"
#include "rtngcalc.h"
#include "relprior.h"
extern gamesnum_t
calc_rating ( bool_t quiet
, bool_t prior_mode
, bool_t adjust_wadv
, bool_t adjust_drate
, bool_t anchor_use
, bool_t anchor_err_rel2avg
, double general_average
, player_t anchor
, player_t priored_n
, double beta
, struct ENCOUNTERS * encount
, struct rel_prior_set * rps
, struct PLAYERS * plyrs
, struct RATINGS * rat
, struct GAMES * pGames
, struct prior * pPrior
, struct prior wa_prior
, struct prior dr_prior
, double * pWhite_advantage
, double * pDraw_rate
)
{
double dr = *pDraw_rate;
gamesnum_t ret;
if (prior_mode) {
ret = calc_rating_bayes
( quiet
, adjust_wadv
, adjust_drate
, anchor_use && !anchor_err_rel2avg
, beta
, general_average
, anchor
, priored_n
, rps->n
, encount
, plyrs
, pGames
, rat
, pPrior
, rps->x
, wa_prior
, dr_prior
, pWhite_advantage
, &dr
);
} else {
double *ratingtmp_memory;
assert(plyrs->n > 0);
if (NULL != (ratingtmp_memory = memnew (sizeof(double) * (size_t)plyrs->n))) {
assert(ratings_sanity (plyrs->n, rat->ratingof));
ret = calc_rating_ordo
( quiet
, adjust_wadv
, adjust_drate
, anchor_use && !anchor_err_rel2avg
, ratingtmp_memory
, beta
, general_average
, anchor
, encount
, plyrs
, pGames
, rat
, pWhite_advantage
, &dr
);
memrel(ratingtmp_memory);
} else {
fprintf(stderr, "Not enough memory available\n");
exit(EXIT_FAILURE);
}
}
*pDraw_rate = dr;
return ret;
}