4 # Author:: Daigo Moriwaki
5 # Homepage:: http://sourceforge.jp/projects/shogi-server/
8 # Copyright (C) 2006-2012 Daigo Moriwaki <daigo at debian dot org>
10 # This program is free software; you can redistribute it and/or modify
11 # it under the terms of the GNU General Public License as published by
12 # the Free Software Foundation; either version 2 of the License, or
13 # (at your option) any later version.
15 # This program is distributed in the hope that it will be useful,
16 # but WITHOUT ANY WARRANTY; without even the implied warranty of
17 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 # GNU General Public License for more details.
20 # You should have received a copy of the GNU General Public License
21 # along with this program; if not, write to the Free Software
22 # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
27 # mk_rate reads game results files generated by the mk_game_results command,
28 # calculates rating scores of each player, and then outputs a yaml file
29 # (players.yaml) that Shogi-server can recognize.
33 # ./mk_rate [options] GAME_RESULTS_FILE [...]
38 # a path to a file listing results of games, which is genrated by the
39 # mk_game_results command.
40 # In the second style above, the file content can be read from the stdin.
43 # a base time point for this calicuration (default now). Ex. '2009-10-31'
46 # n [days] (default 60)
48 # --half-life-ignore::
49 # m [days] (default 7)
50 # after m days, the half-life effect works
53 # m [days] (default 365*2)
54 # old results will be ignored
56 # --fixed-rate-player::
57 # player whose rate is fixed at the rate
63 # skip draw games. [default: draw games are counted in as 0.5 win and 0.5
71 # Sample Command lines that isntall prerequires will work on Debian.
73 # * Ruby 1.9.3 or 1.8.7 (including Rubygems)
75 # $ sudo aptitude install ruby1.9.1
77 # * Ruby bindings for the GNU Scientific Library (GSL[http://rb-gsl.rubyforge.org/])
79 # $ sudo aptitude install ruby-gsl
81 # * RGL: {Ruby Graph Library}[http://rubyforge.org/projects/rgl/]
83 # $ sudo gem1.9.1 install rgl
87 # $ ./mk_rate game_results.txt > players.yaml
89 # $ ./mk_game_results . | ./mk_rate > players.yaml
91 # If you do not want the file to be update in case of errors,
93 # $ ./mk_rate game_results.txt && ./mk_rate game_results.txt > players.yaml
95 # == How players are rated
97 # The conditions that games and players are rated as following:
99 # * Rated games, which were played by both rated players.
100 # * Rated players, who logged in the server with a name followed by a trip: "name,trip".
101 # * (Rated) players, who played more than $GAMES_LIMIT [15] (rated) games.
110 require 'rgl/adjacency'
111 require 'rgl/connected_components'
113 #################################################
117 # Count out players who play less games than $GAMES_LIMIT
118 $GAMES_LIMIT = $DEBUG ? 0 : 15
125 # Holds the last time when a player gamed
126 $players_time = Hash.new { Time.at(0) }
127 # Holds history of input lines to check duplicated inputs
131 #################################################
132 # Keeps the value of the lowest key
140 if @lowest.empty? || key < @lowest[0]
141 @lowest = [key, value]
154 #################################################
155 # Calculates rates of every player from a Win Loss GSL::Matrix
160 # The model of the win possibility is 1/(1 + 10^(-d/400)).
161 # The equation in this class is 1/(1 + e^(-Kd)).
162 # So, K should be calculated like this.
163 K = Math.log(10.0) / 400.0
165 # Convergence limit to stop Newton method.
167 # Stop Newton method after this iterations.
170 # Average rate among the players
179 # Calcurates the average of the vector.
181 def Rating.average(vector, mean=0.0)
182 sum = Array(vector).inject(0.0) {|sum, n| sum + n}
183 vector -= GSL::Vector[*Array.new(vector.size, sum/vector.size - mean)]
190 def initialize(win_loss_matrix)
194 when GSL::Matrix, GSL::Matrix::Int
203 attr_reader :rate, :n
207 (0...@size).collect {|k| yield k}
212 (0...@size).each {|k| yield k}
216 # The possibility that the player k will beet the player i.
219 1.0/(1.0 + exp(@rate[i]-@rate[k]))
223 # Most possible equation
230 sum += @n[k,i] * win_rate(i,k) - @n[i,k] * win_rate(k,i)
237 # / f0/R0 f0/R1 f0/R2 ... \
238 # dfk/dRj = | f1/R0 f1/R1 f1/R2 ... |
239 # \ f2/R0 f2/R1 f2/R2 ... /
245 sum += win_rate(i,k) * win_rate(k,i) * (@n[k,i] + @n[i,k])
249 sum = 2.0 * win_rate(j,k) * win_rate(k,j) * (@n[k,j] + @n[j,k])
255 # Jacobi matrix of the func().
261 (0...@size).collect do |k|
262 (0...@size).collect do |j|
270 # The initial value of the rate, which is of very importance for Newton
271 # method. This is based on my huristics; the higher the win probablity of
272 # a player is, the greater points he takes.
277 v = GSL::Vector[0, 0]
280 v += GSL::Vector[@n[k,i], @n[i,k]]
282 v.nrm2 < 1 ? 0 : v[0] / (v[0] + v[1])
284 rank = possibility.sort_index
285 @rate = player_vector do |k|
286 K*500 * (rank[k]+1) / @size
292 # Resets @rate as the higher the current win probablity of a player is,
293 # the greater points he takes.
296 @rate = @record.get || @rate
297 rank = @rate.sort_index
298 @rate = player_vector do |k|
299 K*@count*1.5 * (rank[k]+1) / @size
304 # mu is the deaccelrating parameter in Deaccelerated Newton method
305 def deaccelrate(mu, old_rate, a, old_f_nrm2)
306 @rate = old_rate - a * mu
307 if func_vector.nrm2 < (1 - mu / 4.0 ) * old_f_nrm2 then
311 @record.set(func_vector.nrm2, @rate)
315 $stderr.puts "mu: %f " % [mu] if $DEBUG
316 deaccelrate(mu*0.5, old_rate, a, old_f_nrm2)
320 # Main process to calculate ratings.
323 # Counter to stop the process.
324 # Calulation in Newton method may fall in an infinite loop
329 # Solve the equation:
331 # @rate_(n+1) = @rate_(n) - a
333 # f.nrm2 should approach to zero.
337 # $stderr.puts "j: %s" % [j.inspect] if $DEBUG
338 $stderr.puts "f: %s -> %f" % [f.to_a.inspect, f.nrm2] if $DEBUG
340 # GSL::Linalg::LU.solve or GSL::Linalg::HH.solve would be available instead.
341 #a = GSL::Linalg::HH.solve(j, f)
342 a, = GSL::MultiFit::linear(j, f)
343 a = self.class.average(a)
344 # $stderr.puts "a: %s -> %f" % [a.to_a.inspect, a.nrm2] if $DEBUG
346 # Deaccelerated Newton method
347 # GSL::Vector object should be immutable.
350 old_f_nrm2 = old_f.nrm2
351 deaccelrate(1.0, old_rate, a, old_f_nrm2)
352 #@rate -= a # Instead, do not deaccelerate
353 @record.set(func_vector.nrm2, @rate)
355 $stderr.printf "|error| : %5.2e\n", a.nrm2 if $DEBUG
358 if @count > COUNT_MAX
359 $stderr.puts "Values seem to oscillate. Stopped the process."
360 $stderr.puts "f: %s -> %f" % [func_vector.to_a.inspect, func_vector.nrm2]
364 end while (a.nrm2 > ERROR_LIMIT * @rate.nrm2)
367 $stderr.puts "resolved f: %s -> %f" %
368 [func_vector.to_a.inspect, func_vector.nrm2] if $DEBUG
369 $stderr.puts "Count: %d" % [@count] if $DEBUG
377 # Make the values of @rate finite.
380 @rate = @rate.collect do |a|
382 a.infinite? * AVERAGE_RATE * 100
390 # Flatten the values of @rate.
392 def average!(mean=0.0)
393 @rate = self.class.average(@rate, mean)
399 def translate!(value)
404 # Make the values of @rate integer.
407 @rate = @rate.collect do |a|
413 a.infinite? * AVERAGE_RATE * 100
419 #################################################
420 # Encapsulate a pair of keys and win loss matrix.
421 # - keys is an array of player IDs; [gps+123, foo+234, ...]
422 # - matrix holds games # where player i (row index) beats player j (column index).
423 # The row and column indexes match with the keys.
425 # This object should be immutable. If an internal state is being modified, a
426 # new object is always returned.
434 def self.mk_matrix(players)
435 keys = players.keys.sort
439 ((0...size).collect do |k|
441 p1_hash = players[p1]
442 ((0...size).collect do |j|
447 v = p1_hash[p2] || GSL::Vector[0,0]
452 return WinLossMatrix.new(keys, matrix)
455 def self.mk_win_loss_matrix(players)
456 obj = mk_matrix(players)
464 # an array of player IDs; [gps+123, foo+234, ...]
467 # matrix holds games # where player i (row index) beats player j (column index).
468 # The row and column indexes match with the keys.
471 def initialize(keys, matrix)
477 # Returns the size of the keys/matrix
488 # Removes players in a rows such as [1,3,5], and then returns a new
491 def delete_rows(rows)
492 rows = rows.sort.reverse
495 (0...size).each do |i|
496 next if rows.include?(i)
497 row = @matrix.row(i).clone
503 if copied_cols.size == 0
504 new_matrix = GSL::Matrix.new
506 new_matrix = GSL::Matrix[*copied_cols]
509 new_keys = @keys.clone
511 new_keys.delete_at(j)
514 return WinLossMatrix.new(new_keys, new_matrix)
518 # Removes players who do not pass a criteria to be rated, and returns a
522 $stderr.puts @keys.inspect if $DEBUG
523 $stderr.puts @matrix.inspect if $DEBUG
525 (0...size).each do |i|
530 if win < 1 || loss < 1 || win + loss < $GAMES_LIMIT
535 # The recursion ends if there is nothing to delete
536 return self if delete.empty?
538 new_obj = delete_rows(delete)
543 # Cuts self into connecting groups such as each player in a group has at least
544 # one game with other players in the group. Returns them as an array.
546 def connected_subsets
547 g = RGL::AdjacencyGraph.new
548 (0...size).each do |k|
549 (0...size).each do |i|
558 g.each_connected_component do |c|
561 new_keys << keys[v.to_s.to_i]
566 subsets = subsets.sort {|a,b| b.size <=> a.size}
568 result = subsets.collect do |keys|
571 ((0...keys.size).collect do |k|
572 p1 = @keys.index(keys[k])
573 ((0...keys.size).collect do |j|
577 p2 = @keys.index(keys[j])
582 WinLossMatrix.new(keys, matrix)
589 "size : #{@keys.size}" + "\n" +
590 @keys.inspect + "\n" +
597 #################################################
602 # After NHAFE_LIFE days value will get half.
603 # 0.693 is constant, where exp(0.693) ~ 0.5
605 if days < $options["half-life-ignore"]
608 Math::exp(-0.693/$options["half-life"]*(days-$options["half-life-ignore"]))
612 def _add_win_loss(winner, loser, time)
613 how_long_days = ($options["base-date"] - time)/(3600*24)
614 $players[winner] ||= Hash.new { GSL::Vector[0,0] }
615 $players[loser] ||= Hash.new { GSL::Vector[0,0] }
616 $players[winner][loser] += GSL::Vector[1.0*half_life(how_long_days),0]
617 $players[loser][winner] += GSL::Vector[0,1.0*half_life(how_long_days)]
620 def _add_draw(player1, player2, time)
621 how_long_days = ($options["base-date"] - time)/(3600*24)
622 $players[player1] ||= Hash.new { GSL::Vector[0,0] }
623 $players[player2] ||= Hash.new { GSL::Vector[0,0] }
624 $players[player1][player2] += GSL::Vector[0.5*half_life(how_long_days),0.5*half_life(how_long_days)]
625 $players[player2][player1] += GSL::Vector[0.5*half_life(how_long_days),0.5*half_life(how_long_days)]
628 def _add_time(player, time)
629 $players_time[player] = time if $players_time[player] < time
632 def add(black_mark, black_name, white_name, white_mark, time)
633 if black_mark == WIN_MARK && white_mark == LOSS_MARK
634 _add_win_loss(black_name, white_name, time)
635 elsif black_mark == LOSS_MARK && white_mark == WIN_MARK
636 _add_win_loss(white_name, black_name, time)
637 elsif black_mark == DRAW_MARK && white_mark == DRAW_MARK
638 if $options["skip-draw-games"]
641 _add_draw(black_name, white_name, time)
644 raise "Never reached!"
646 _add_time(black_name, time)
647 _add_time(white_name, time)
651 if /@NORATE\+/ =~ id # the player having @NORATE in the name should not be rated
654 id.gsub(/@.*?\+/,"+")
657 # Parse a game result line
660 if $history.include? line
661 $stderr.puts "[WARNING] Duplicated: #{line}"
666 time, state, black_mark, black_id, white_id, white_mark, file = line.split("\t")
667 unless time && state && black_mark && black_id &&
668 white_id && white_mark && file
669 $stderr.puts "Failed to parse the line : #{line}"
673 return if state == "abnormal"
674 time = Time.parse(time)
675 return if $options["base-date"] < time
676 how_long_days = ($options["base-date"] - time)/(3600*24)
677 if (how_long_days > $options["ignore"])
681 black_id = identify_id(black_id)
682 white_id = identify_id(white_id)
684 if black_id && white_id && (black_id != white_id) &&
685 black_mark && white_mark
686 add(black_mark, black_id, white_id, white_mark, time)
691 yaml["players"].each do |group_key, group|
692 group.each do |player_key, player|
693 rate = player['rate']
695 if rate > 10000 || rate < -10000
705 USAGE: #{$0} [options] GAME_RESULTS_FILE [...]
709 a path to a file listing results of games, which is genrated by the
710 mk_game_results command.
711 In the second style above, the file content can be read from the stdin.
714 --base-date a base time point for this calicuration (default now). Ex. '2009-10-31'
715 --half-life n [days] (default 60)
716 --half-life-ignore m [days] (default 7)
717 after m days, half-life effect works
718 --ignore n [days] (default 730 [=365*2]).
719 Results older than n days from the 'base-date' are ignored.
720 --fixed-rate-player player whose rate is fixed at the rate
722 --skip-draw-games skip draw games. [default: draw games are counted in
723 as 0.5 win and 0.5 lost]
724 --help show this message
730 parser = GetoptLong.new(
731 ["--base-date", GetoptLong::REQUIRED_ARGUMENT],
732 ["--half-life", GetoptLong::REQUIRED_ARGUMENT],
733 ["--half-life-ignore", GetoptLong::REQUIRED_ARGUMENT],
734 ["--help", "-h", GetoptLong::NO_ARGUMENT],
735 ["--ignore", GetoptLong::REQUIRED_ARGUMENT],
736 ["--fixed-rate-player", GetoptLong::REQUIRED_ARGUMENT],
737 ["--fixed-rate", GetoptLong::REQUIRED_ARGUMENT],
738 ["--skip-draw-games", GetoptLong::NO_ARGUMENT])
741 parser.each_option do |name, arg|
743 $options[name] = arg.dup
745 if ( $options["fixed-rate-player"] && !$options["fixed-rate"]) ||
746 (!$options["fixed-rate-player"] && $options["fixed-rate"]) ||
747 ( $options["fixed-rate-player"] && $options["fixed-rate"].to_i <= 0)
753 raise parser.error_message
759 if $options["base-date"]
760 $options["base-date"] = Time::parse $options["base-date"]
762 $options["base-date"] = Time.now
764 $options["half-life"] ||= 60
765 $options["half-life"] = $options["half-life"].to_i
766 $options["half-life-ignore"] ||= 7
767 $options["half-life-ignore"] = $options["half-life-ignore"].to_i
768 $options["ignore"] ||= 365*2
769 $options["ignore"] = $options["ignore"].to_i
770 $options["fixed-rate"] = $options["fixed-rate"].to_i if $options["fixed-rate"]
773 while line = $stdin.gets do
777 while file = ARGV.shift do
778 File.open(file) do |f|
779 f.each_line do |line|
790 obj = WinLossMatrix::mk_win_loss_matrix($players)
791 obj.connected_subsets.each do |win_loss_matrix|
792 yaml["players"][rating_group] = {}
794 rating = Rating.new(win_loss_matrix.matrix)
796 rating.average!(Rating::AVERAGE_RATE)
799 if $options["fixed-rate-player"]
800 # first, try exact match
801 index = win_loss_matrix.keys.index($options["fixed-rate-player"])
802 # second, try regular match
804 win_loss_matrix.keys.each_with_index do |p, i|
805 if %r!#{$options["fixed-rate-player"]}! =~ p
811 the_rate = rating.rate[index]
812 rating.translate!($options["fixed-rate"] - the_rate)
816 win_loss_matrix.keys.each_with_index do |p, i| # player_id, index#
817 win = win_loss_matrix.matrix.row(i).sum
818 loss = win_loss_matrix.matrix.col(i).sum
820 yaml["players"][rating_group][p] =
821 { 'name' => p.split("+")[0],
822 'rating_group' => rating_group,
823 'rate' => rating.rate[i],
824 'last_modified' => $players_time[p].dup,
832 non_rated_group = 999 # large enough
833 yaml["players"][non_rated_group] = {}
834 $players.each_key do |id|
835 # skip players who have already been rated
837 (0..rating_group).each do |i|
838 found = true if yaml["players"][i][id]
843 v = GSL::Vector[0, 0]
844 $players[id].each_value {|value| v += value}
845 next if v[0] < 1 && v[1] < 1
847 yaml["players"][non_rated_group][id] =
848 { 'name' => id.split("+")[0],
849 'rating_group' => non_rated_group,
851 'last_modified' => $players_time[id].dup,
855 unless validate(yaml)
856 $stderr.puts "Aborted. It did not result in valid ratings."
857 $stderr.puts yaml.to_yaml if $DEBUG
867 # vim: ts=2 sw=2 sts=0