+2013-12-13 Daigo Moriwaki <daigo at debian dot org>
+
+ * [shogi-server]
+ - shogi_server/league/floodgate_thread.rb:
+ - Added a log message.
+
+2013-12-08 Daigo Moriwaki <daigo at debian dot org>
+
+ * [shogi-server]
+ - shogi-server/shogi_server/pairing.rb:
+ - Modified comment for LeastDiff match.
+ - Changed log messages and levels.
+
+2013-12-07 Daigo Moriwaki <daigo at debian dot org>
+
+ * [shogi-server]
+ - shogi_server/pairing.rb, player.rb:
+ Simplify estimated rate of unrated players (less memory).
+ - Enhanced syntax of Floodgate time configuration file.
+ Now it supports "set sacrifice <player_id>"; it sets a
+ sacrificed player for a specific Floodgate game.
+ ex. set sacrifice gps500+e293220e3f8a3e59f79f6b0efffaa931
+
+2013-12-05 Daigo Moriwaki <daigo at debian dot org>
+
+ * [shogi-server]
+ - Added a new pairing method, ShogiServer::ExcludeUnratedPlayers,
+ which filters out unrated players.
+ - Enhanced syntax of Floodgate time configuration file.
+ Now it supports "set pairing_factory <function_name>"; it sets a
+ factory function name generating a pairing method which will be
+ used in a specific Floodgate game.
+ ex. set pairing_factory floodgate_zyunisen
+
2013-11-24 Daigo Moriwaki <daigo at debian dot org>
* [shogi-server]
already in use - bind(2)".
* [mk_game_results]
- Fixed for reading Japanese comments under ruby1.9.3p194.
+ * mk_rate-from-grep, mk_rate-grep:
+ - Removed files that are no longer used.
2013-11-23 Daigo Moriwaki <daigo at debian dot org>
+++ /dev/null
-#!/usr/bin/ruby
-# $Id: mk_rate 316 2008-12-28 15:10:10Z beatles $
-#
-# Author:: Daigo Moriwaki
-# Homepage:: http://sourceforge.jp/projects/shogi-server/
-#
-#--
-# Copyright (C) 2006-2008 Daigo Moriwaki <daigo at debian dot org>
-#
-# This program 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 2 of the License, or
-# (at your option) any later version.
-#
-# This program 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 this program; if not, write to the Free Software
-# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
-#++
-#
-# == Synopsis
-#
-# mk_rate reads CSA files, calculates rating scores of each player, and then
-# outputs a yaml file (players.yaml) that Shogi-server can recognize.
-#
-# == Usage
-#
-# ./mk_rate [options] DIR..
-#
-# DIR::
-# CSA files are recursively looked up the directories.
-#
-# --half-life::
-# n [days] (default 60)
-#
-# --half-life-ignore::
-# m [days] (default 7)
-# after m days, the half-life effect works
-#
-# --ignore::
-# m [days] (default 365*2)
-# old files will be ignored
-#
-# --fixed-rate-player::
-# player whose rate is fixed at the rate
-#
-# --fixed-rate::
-# rate
-#
-# --help::
-# show this message
-#
-# == PREREQUIRE
-#
-# Sample Command lines that isntall prerequires will work on Debian.
-#
-# * Ruby 1.8.7
-#
-# $ sudo aptitude install ruby1.8
-#
-# * Rubygems
-#
-# $ sudo aptitude install rubygems
-#
-# * Ruby bindings for the GNU Scientific Library (GSL[http://rb-gsl.rubyforge.org/])
-#
-# $ sudo aptitude install libgsl-ruby1.8
-#
-# * RGL: {Ruby Graph Library}[http://rubyforge.org/projects/rgl/]
-#
-# $ sudo gem install rgl
-#
-# == Run
-#
-# $ ./mk_rate . > players.yaml
-#
-# or, if you do not want the file to be update in case of errors,
-#
-# $ ./mk_rate . && ./mk_rate . > players.yaml
-#
-# == How players are rated
-#
-# The conditions that games and players are rated as following:
-#
-# * Rated games, which were played by both rated players.
-# * Rated players, who logged in the server with a name followed by a trip: "name,trip".
-# * (Rated) players, who played more than $GAMES_LIMIT [15] (rated) games.
-#
-
-require 'yaml'
-require 'time'
-require 'getoptlong'
-require 'gsl'
-require 'rubygems'
-require 'rgl/adjacency'
-require 'rgl/connected_components'
-
-#################################################
-# Constants
-#
-
-# Count out players who play less games than $GAMES_LIMIT
-$GAMES_LIMIT = $DEBUG ? 0 : 15
-WIN_MARK = "win"
-LOSS_MARK = "lose"
-DRAW_MARK = "draw"
-
-# Holds players
-$players = Hash.new
-# Holds the last time when a player gamed
-$players_time = Hash.new { Time.at(0) }
-
-
-#################################################
-# Keeps the value of the lowest key
-#
-class Record
- def initialize
- @lowest = []
- end
-
- def set(key, value)
- if @lowest.empty? || key < @lowest[0]
- @lowest = [key, value]
- end
- end
-
- def get
- if @lowest.empty?
- nil
- else
- @lowest[1]
- end
- end
-end
-
-#################################################
-# Calculates rates of every player from a Win Loss GSL::Matrix
-#
-class Rating
- include Math
-
- # The model of the win possibility is 1/(1 + 10^(-d/400)).
- # The equation in this class is 1/(1 + e^(-Kd)).
- # So, K should be calculated like this.
- K = Math.log(10.0) / 400.0
-
- # Convergence limit to stop Newton method.
- ERROR_LIMIT = 1.0e-3
- # Stop Newton method after this iterations.
- COUNT_MAX = 500
-
- # Average rate among the players
- AVERAGE_RATE = 1000
-
-
- ###############
- # Class methods
- #
-
- ##
- # Calcurates the average of the vector.
- #
- def Rating.average(vector, mean=0.0)
- sum = Array(vector).inject(0.0) {|sum, n| sum + n}
- vector -= GSL::Vector[*Array.new(vector.size, sum/vector.size - mean)]
- vector
- end
-
- ##################
- # Instance methods
- #
- def initialize(win_loss_matrix)
- @record = Record.new
- @n = win_loss_matrix
- case @n
- when GSL::Matrix, GSL::Matrix::Int
- @size = @n.size1
- when ::Matrix
- @size = @n.row_size
- else
- raise ArgumentError
- end
- initial_rate
- end
- attr_reader :rate, :n
-
- def player_vector
- GSL::Vector[*
- (0...@size).collect {|k| yield k}
- ]
- end
-
- def each_player
- (0...@size).each {|k| yield k}
- end
-
- ##
- # The possibility that the player k will beet the player i.
- #
- def win_rate(k,i)
- 1.0/(1.0 + exp(@rate[i]-@rate[k]))
- end
-
- ##
- # Most possible equation
- #
- def func_vector
- player_vector do|k|
- sum = 0.0
- each_player do |i|
- next if i == k
- sum += @n[k,i] * win_rate(i,k) - @n[i,k] * win_rate(k,i)
- end
- sum * 2.0
- end
- end
-
- ##
- # / f0/R0 f0/R1 f0/R2 ... \
- # dfk/dRj = | f1/R0 f1/R1 f1/R2 ... |
- # \ f2/R0 f2/R1 f2/R2 ... /
- def d_func(k,j)
- sum = 0.0
- if k == j
- each_player do |i|
- next if i == k
- sum += win_rate(i,k) * win_rate(k,i) * (@n[k,i] + @n[i,k])
- end
- sum *= -2.0
- else # k != j
- sum = 2.0 * win_rate(j,k) * win_rate(k,j) * (@n[k,j] + @n[j,k])
- end
- sum
- end
-
- ##
- # Jacobi matrix of the func().
- # m00 m01
- # m10 m11
- #
- def j_matrix
- GSL::Matrix[*
- (0...@size).collect do |k|
- (0...@size).collect do |j|
- d_func(k,j)
- end
- end
- ]
- end
-
- ##
- # The initial value of the rate, which is of very importance for Newton
- # method. This is based on my huristics; the higher the win probablity of
- # a player is, the greater points he takes.
- #
- def initial_rate
- possibility =
- player_vector do |k|
- v = GSL::Vector[0, 0]
- each_player do |i|
- next if k == i
- v += GSL::Vector[@n[k,i], @n[i,k]]
- end
- v.nrm2 < 1 ? 0 : v[0] / (v[0] + v[1])
- end
- rank = possibility.sort_index
- @rate = player_vector do |k|
- K*500 * (rank[k]+1) / @size
- end
- average!
- end
-
- ##
- # Resets @rate as the higher the current win probablity of a player is,
- # the greater points he takes.
- #
- def initial_rate2
- @rate = @record.get || @rate
- rank = @rate.sort_index
- @rate = player_vector do |k|
- K*@count*1.5 * (rank[k]+1) / @size
- end
- average!
- end
-
- # mu is the deaccelrating parameter in Deaccelerated Newton method
- def deaccelrate(mu, old_rate, a, old_f_nrm2)
- @rate = old_rate - a * mu
- if func_vector.nrm2 < (1 - mu / 4.0 ) * old_f_nrm2 then
- return
- end
- if mu < 1e-4
- @record.set(func_vector.nrm2, @rate)
- initial_rate2
- return
- end
- $stderr.puts "mu: %f " % [mu] if $DEBUG
- deaccelrate(mu*0.5, old_rate, a, old_f_nrm2)
- end
-
- ##
- # Main process to calculate ratings.
- #
- def rating
- # Counter to stop the process.
- # Calulation in Newton method may fall in an infinite loop
- @count = 0
-
- # Main loop
- begin
- # Solve the equation:
- # J*a=f
- # @rate_(n+1) = @rate_(n) - a
- #
- # f.nrm2 should approach to zero.
- f = func_vector
- j = j_matrix
-
- # $stderr.puts "j: %s" % [j.inspect] if $DEBUG
- $stderr.puts "f: %s -> %f" % [f.to_a.inspect, f.nrm2] if $DEBUG
-
- # GSL::Linalg::LU.solve or GSL::Linalg::HH.solve would be available instead.
- #a = GSL::Linalg::HH.solve(j, f)
- a, = GSL::MultiFit::linear(j, f)
- a = self.class.average(a)
- # $stderr.puts "a: %s -> %f" % [a.to_a.inspect, a.nrm2] if $DEBUG
-
- # Deaccelerated Newton method
- # GSL::Vector object should be immutable.
- old_rate = @rate
- old_f = f
- old_f_nrm2 = old_f.nrm2
- deaccelrate(1.0, old_rate, a, old_f_nrm2)
- @record.set(func_vector.nrm2, @rate)
-
- $stderr.printf "|error| : %5.2e\n", a.nrm2 if $DEBUG
-
- @count += 1
- if @count > COUNT_MAX
- $stderr.puts "Values seem to oscillate. Stopped the process."
- $stderr.puts "f: %s -> %f" % [func_vector.to_a.inspect, func_vector.nrm2]
- break
- end
-
- end while (a.nrm2 > ERROR_LIMIT * @rate.nrm2)
-
- @rate = @record.get
- $stderr.puts "resolved f: %s -> %f" %
- [func_vector.to_a.inspect, func_vector.nrm2] if $DEBUG
-
- @rate *= 1.0/K
- finite!
- self
- end
-
- ##
- # Make the values of @rate finite.
- #
- def finite!
- @rate = @rate.collect do |a|
- if a.infinite?
- a.infinite? * AVERAGE_RATE * 100
- else
- a
- end
- end
- end
-
- ##
- # Flatten the values of @rate.
- #
- def average!(mean=0.0)
- @rate = self.class.average(@rate, mean)
- end
-
- ##
- # Translate by value
- #
- def translate!(value)
- @rate += value
- end
-
- ##
- # Make the values of @rate integer.
- #
- def integer!
- @rate = @rate.collect do |a|
- if a.finite?
- a.to_i
- elsif a.nan?
- 0
- elsif a.infinite?
- a.infinite? * AVERAGE_RATE * 100
- end
- end
- end
-end
-
-#################################################
-# Encapsulate a pair of keys and win loss matrix.
-# - keys is an array of player IDs; [gps+123, foo+234, ...]
-# - matrix holds games # where player i (row index) beats player j (column index).
-# The row and column indexes match with the keys.
-#
-# This object should be immutable. If an internal state is being modified, a
-# new object is always returned.
-#
-class WinLossMatrix
-
- ###############
- # Class methods
- #
-
- def self.mk_matrix(players)
- keys = players.keys.sort
- size = keys.size
- matrix =
- GSL::Matrix[*
- ((0...size).collect do |k|
- p1 = keys[k]
- p1_hash = players[p1]
- ((0...size).collect do |j|
- if k == j
- 0
- else
- p2 = keys[j]
- v = p1_hash[p2] || Vector[0,0]
- v[0]
- end
- end)
- end)]
- return WinLossMatrix.new(keys, matrix)
- end
-
- def self.mk_win_loss_matrix(players)
- obj = mk_matrix(players)
- return obj.filter
- end
-
- ##################
- # Instance methods
- #
-
- # an array of player IDs; [gps+123, foo+234, ...]
- attr_reader :keys
-
- # matrix holds games # where player i (row index) beats player j (column index).
- # The row and column indexes match with the keys.
- attr_reader :matrix
-
- def initialize(keys, matrix)
- @keys = keys
- @matrix = matrix
- end
-
- ##
- # Returns the size of the keys/matrix
- #
- def size
- if @keys
- @keys.size
- else
- nil
- end
- end
-
- ##
- # Removes players in a rows such as [1,3,5], and then returns a new
- # object.
- #
- def delete_rows(rows)
- rows = rows.sort.reverse
-
- copied_cols = []
- (0...size).each do |i|
- next if rows.include?(i)
- row = @matrix.row(i).clone
- rows.each do |j|
- row.delete_at(j)
- end
- copied_cols << row
- end
- if copied_cols.size == 0
- new_matrix = GSL::Matrix.new
- else
- new_matrix = GSL::Matrix[*copied_cols]
- end
-
- new_keys = @keys.clone
- rows.each do |j|
- new_keys.delete_at(j)
- end
-
- return WinLossMatrix.new(new_keys, new_matrix)
- end
-
- ##
- # Removes players who do not pass a criteria to be rated, and returns a
- # new object.
- #
- def filter
- $stderr.puts @keys.inspect if $DEBUG
- $stderr.puts @matrix.inspect if $DEBUG
- delete = []
- (0...size).each do |i|
- row = @matrix.row(i)
- col = @matrix.col(i)
- win = row.sum
- loss = col.sum
- if win < 1 || loss < 1 || win + loss < $GAMES_LIMIT
- delete << i
- end
- end
-
- # The recursion ends if there is nothing to delete
- return self if delete.empty?
-
- new_obj = delete_rows(delete)
- new_obj.filter
- end
-
- ##
- # Cuts self into connecting groups such as each player in a group has at least
- # one game with other players in the group. Returns them as an array.
- #
- def connected_subsets
- g = RGL::AdjacencyGraph.new
- (0...size).each do |k|
- (0...size).each do |i|
- next if k == i
- if @matrix[k,i] > 0
- g.add_edge(k,i)
- end
- end
- end
-
- subsets = []
- g.each_connected_component do |c|
- new_keys = []
- c.each do |v|
- new_keys << keys[v.to_s.to_i]
- end
- subsets << new_keys
- end
-
- subsets = subsets.sort {|a,b| b.size <=> a.size}
-
- result = subsets.collect do |keys|
- matrix =
- GSL::Matrix[*
- ((0...keys.size).collect do |k|
- p1 = @keys.index(keys[k])
- ((0...keys.size).collect do |j|
- if k == j
- 0
- else
- p2 = @keys.index(keys[j])
- @matrix[p1,p2] + 0.001
- end
- end)
- end)]
- WinLossMatrix.new(keys, matrix)
- end
-
- return result
- end
-
- def to_s
- "size : #{@keys.size}" + "\n" +
- @keys.inspect + "\n" +
- @matrix.inspect
- end
-
-end
-
-
-#################################################
-# Main methods
-#
-
-# Half-life effect
-# After NHAFE_LIFE days value will get half.
-# 0.693 is constant, where exp(0.693) ~ 0.5
-def half_life(days)
- if days < $options["half-life-ignore"]
- return 1.0
- else
- Math::exp(-0.693/$options["half-life"]*(days-$options["half-life-ignore"]))
- end
-end
-
-def _add_win_loss(winner, loser, time)
- how_long_days = (Time.now - time)/(3600*24)
- $players[winner] ||= Hash.new { GSL::Vector[0,0] }
- $players[loser] ||= Hash.new { GSL::Vector[0,0] }
- $players[winner][loser] += GSL::Vector[1.0*half_life(how_long_days),0]
- $players[loser][winner] += GSL::Vector[0,1.0*half_life(how_long_days)]
-end
-
-def _add_time(player, time)
- $players_time[player] = time if $players_time[player] < time
-end
-
-def add(black_mark, black_name, white_name, white_mark, time)
- how_long_days = (Time.now - time)/(3600*24)
- if (how_long_days > $options["ignore"])
- return
- end
- if black_mark == WIN_MARK && white_mark == LOSS_MARK
- _add_win_loss(black_name, white_name, time)
- elsif black_mark == LOSS_MARK && white_mark == WIN_MARK
- _add_win_loss(white_name, black_name, time)
- elsif black_mark == DRAW_MARK && white_mark == DRAW_MARK
- return
- else
- raise "Never reached!"
- end
- _add_time(black_name, time)
- _add_time(white_name, time)
-end
-
-def identify_id(id)
- if /@NORATE\+/ =~ id # the player having @NORATE in the name should not be rated
- return nil
- end
- id.gsub(/@.*?\+/,"+")
-end
-
-def grep(str)
- if /^([^ ]+) ([^ ]+) ([^ ]+) ([^ ]+) ([0-9]+)$/ =~ str.strip then
- add($1,$2,$3,$4,Time.at($5.to_i))
- end
-end
-
-def usage
- $stderr.puts <<-EOF
-USAGE: #{$0} dir [...]
- EOF
- exit 1
-end
-
-def validate(yaml)
- yaml["players"].each do |group_key, group|
- group.each do |player_key, player|
- rate = player['rate']
- next unless rate
- if rate > 10000 || rate < -10000
- return false
- end
- end
- end
- return true
-end
-
-def usage(io)
- io.puts <<EOF
-USAGE: #{$0} [options] DIR..
- DIR where CSA files are looked up recursively
-OPTOINS:
- --half-life n [days] (default 60)
- --half-life-ignore m [days] (default 7)
- after m days, half-life effect works
- --fixed-rate-player player whose rate is fixed at the rate
- --fixed-rate rate
- --help show this message
-EOF
-end
-
-def main
- $options = Hash::new
- parser = GetoptLong.new(
- ["--half-life", GetoptLong::REQUIRED_ARGUMENT],
- ["--half-life-ignore", GetoptLong::REQUIRED_ARGUMENT],
- ["--ignore", GetoptLong::REQUIRED_ARGUMENT],
- ["--help", "-h", GetoptLong::NO_ARGUMENT],
- ["--fixed-rate-player", GetoptLong::REQUIRED_ARGUMENT],
- ["--fixed-rate", GetoptLong::REQUIRED_ARGUMENT])
- parser.quiet = true
- begin
- parser.each_option do |name, arg|
- name.sub!(/^--/, '')
- $options[name] = arg.dup
- end
- if ( $options["fixed-rate-player"] && !$options["fixed-rate"]) ||
- (!$options["fixed-rate-player"] && $options["fixed-rate"]) ||
- ( $options["fixed-rate-player"] && $options["fixed-rate"].to_i <= 0)
- usage($stderr)
- exit 1
- end
- rescue
- usage($stderr)
- raise parser.error_message
- end
- if $options["help"]
- usage($stdout)
- exit 0
- end
- $options["half-life"] ||= 60
- $options["half-life"] = $options["half-life"].to_i
- $options["half-life-ignore"] ||= 7
- $options["half-life-ignore"] = $options["half-life-ignore"].to_i
- $options["ignore"] ||= 365*2
- $options["ignore"] = $options["ignore"].to_i
- $options["fixed-rate"] = $options["fixed-rate"].to_i if $options["fixed-rate"]
-
- while line = $stdin.gets do
- grep line.strip
- end
-
- yaml = {}
- yaml["players"] = {}
- rating_group = 0
- if $players.size > 0
- obj = WinLossMatrix::mk_win_loss_matrix($players)
- obj.connected_subsets.each do |win_loss_matrix|
- yaml["players"][rating_group] = {}
-
- rating = Rating.new(win_loss_matrix.matrix)
- rating.rating
- rating.average!(Rating::AVERAGE_RATE)
- rating.integer!
-
- if $options["fixed-rate-player"]
- # first, try exact match
- index = win_loss_matrix.keys.index($options["fixed-rate-player"])
- # second, try regular match
- unless index
- win_loss_matrix.keys.each_with_index do |p, i|
- if %r!#{$options["fixed-rate-player"]}! =~ p
- index = i
- end
- end
- end
- if index
- the_rate = rating.rate[index]
- rating.translate!($options["fixed-rate"] - the_rate)
- end
- end
-
- win_loss_matrix.keys.each_with_index do |p, i| # player_id, index#
- win = win_loss_matrix.matrix.row(i).sum
- loss = win_loss_matrix.matrix.col(i).sum
-
- yaml["players"][rating_group][p] =
- { 'name' => p.split("+")[0],
- 'rating_group' => rating_group,
- 'rate' => rating.rate[i],
- 'last_modified' => $players_time[p].dup,
- 'win' => win,
- 'loss' => loss}
- end
- rating_group += 1
- end
- end
- rating_group -= 1
- non_rated_group = 999 # large enough
- yaml["players"][non_rated_group] = {}
- $players.each_key do |id|
- # skip players who have already been rated
- found = false
- (0..rating_group).each do |i|
- found = true if yaml["players"][i][id]
- break if found
- end
- next if found
-
- v = GSL::Vector[0, 0]
- $players[id].each_value {|value| v += value}
- next if v[0] < 1 && v[1] < 1
-
- yaml["players"][non_rated_group][id] =
- { 'name' => id.split("+")[0],
- 'rating_group' => non_rated_group,
- 'rate' => 0,
- 'last_modified' => $players_time[id].dup,
- 'win' => v[0],
- 'loss' => v[1]}
- end
- unless validate(yaml)
- $stderr.puts "Aborted. It did not result in valid ratings."
- $stderr.puts yaml.to_yaml if $DEBUG
- exit 10
- end
- puts yaml.to_yaml
-end
-
-if __FILE__ == $0
- main
-end
-
-# vim: ts=2 sw=2 sts=0
+++ /dev/null
-#!/usr/bin/ruby
-# $Id: mk_rate 316 2008-12-28 15:10:10Z beatles $
-#
-# Author:: Daigo Moriwaki
-# Homepage:: http://sourceforge.jp/projects/shogi-server/
-#
-#--
-# Copyright (C) 2006-2008 Daigo Moriwaki <daigo at debian dot org>
-#
-# This program 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 2 of the License, or
-# (at your option) any later version.
-#
-# This program 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 this program; if not, write to the Free Software
-# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
-#++
-#
-# == Synopsis
-#
-# mk_rate reads CSA files, calculates rating scores of each player, and then
-# outputs a yaml file (players.yaml) that Shogi-server can recognize.
-#
-# == Usage
-#
-# ./mk_rate [options] DIR..
-#
-# DIR::
-# CSA files are recursively looked up the directories.
-#
-# --half-life::
-# n [days] (default 60)
-#
-# --half-life-ignore::
-# m [days] (default 7)
-# after m days, the half-life effect works
-#
-# --fixed-rate-player::
-# player whose rate is fixed at the rate
-#
-# --fixed-rate::
-# rate
-#
-# --help::
-# show this message
-#
-# == PREREQUIRE
-#
-# Sample Command lines that isntall prerequires will work on Debian.
-#
-# * Ruby 1.8.7
-#
-# $ sudo aptitude install ruby1.8
-#
-# * Rubygems
-#
-# $ sudo aptitude install rubygems
-#
-# * Ruby bindings for the GNU Scientific Library (GSL[http://rb-gsl.rubyforge.org/])
-#
-# $ sudo aptitude install libgsl-ruby1.8
-#
-# * RGL: {Ruby Graph Library}[http://rubyforge.org/projects/rgl/]
-#
-# $ sudo gem install rgl
-#
-# == Run
-#
-# $ ./mk_rate . > players.yaml
-#
-# or, if you do not want the file to be update in case of errors,
-#
-# $ ./mk_rate . && ./mk_rate . > players.yaml
-#
-# == How players are rated
-#
-# The conditions that games and players are rated as following:
-#
-# * Rated games, which were played by both rated players.
-# * Rated players, who logged in the server with a name followed by a trip: "name,trip".
-# * (Rated) players, who played more than $GAMES_LIMIT [15] (rated) games.
-#
-
-require 'yaml'
-require 'time'
-require 'getoptlong'
-require 'gsl'
-require 'rubygems'
-require 'rgl/adjacency'
-require 'rgl/connected_components'
-
-#################################################
-# Constants
-#
-
-# Count out players who play less games than $GAMES_LIMIT
-$GAMES_LIMIT = $DEBUG ? 0 : 15
-WIN_MARK = "win"
-LOSS_MARK = "lose"
-DRAW_MARK = "draw"
-
-# Holds players
-$players = Hash.new
-# Holds the last time when a player gamed
-$players_time = Hash.new { Time.at(0) }
-
-
-#################################################
-# Keeps the value of the lowest key
-#
-class Record
- def initialize
- @lowest = []
- end
-
- def set(key, value)
- if @lowest.empty? || key < @lowest[0]
- @lowest = [key, value]
- end
- end
-
- def get
- if @lowest.empty?
- nil
- else
- @lowest[1]
- end
- end
-end
-
-#################################################
-# Calculates rates of every player from a Win Loss GSL::Matrix
-#
-class Rating
- include Math
-
- # The model of the win possibility is 1/(1 + 10^(-d/400)).
- # The equation in this class is 1/(1 + e^(-Kd)).
- # So, K should be calculated like this.
- K = Math.log(10.0) / 400.0
-
- # Convergence limit to stop Newton method.
- ERROR_LIMIT = 1.0e-3
- # Stop Newton method after this iterations.
- COUNT_MAX = 500
-
- # Average rate among the players
- AVERAGE_RATE = 1000
-
-
- ###############
- # Class methods
- #
-
- ##
- # Calcurates the average of the vector.
- #
- def Rating.average(vector, mean=0.0)
- sum = Array(vector).inject(0.0) {|sum, n| sum + n}
- vector -= GSL::Vector[*Array.new(vector.size, sum/vector.size - mean)]
- vector
- end
-
- ##################
- # Instance methods
- #
- def initialize(win_loss_matrix)
- @record = Record.new
- @n = win_loss_matrix
- case @n
- when GSL::Matrix, GSL::Matrix::Int
- @size = @n.size1
- when ::Matrix
- @size = @n.row_size
- else
- raise ArgumentError
- end
- initial_rate
- end
- attr_reader :rate, :n
-
- def player_vector
- GSL::Vector[*
- (0...@size).collect {|k| yield k}
- ]
- end
-
- def each_player
- (0...@size).each {|k| yield k}
- end
-
- ##
- # The possibility that the player k will beet the player i.
- #
- def win_rate(k,i)
- 1.0/(1.0 + exp(@rate[i]-@rate[k]))
- end
-
- ##
- # Most possible equation
- #
- def func_vector
- player_vector do|k|
- sum = 0.0
- each_player do |i|
- next if i == k
- sum += @n[k,i] * win_rate(i,k) - @n[i,k] * win_rate(k,i)
- end
- sum * 2.0
- end
- end
-
- ##
- # / f0/R0 f0/R1 f0/R2 ... \
- # dfk/dRj = | f1/R0 f1/R1 f1/R2 ... |
- # \ f2/R0 f2/R1 f2/R2 ... /
- def d_func(k,j)
- sum = 0.0
- if k == j
- each_player do |i|
- next if i == k
- sum += win_rate(i,k) * win_rate(k,i) * (@n[k,i] + @n[i,k])
- end
- sum *= -2.0
- else # k != j
- sum = 2.0 * win_rate(j,k) * win_rate(k,j) * (@n[k,j] + @n[j,k])
- end
- sum
- end
-
- ##
- # Jacobi matrix of the func().
- # m00 m01
- # m10 m11
- #
- def j_matrix
- GSL::Matrix[*
- (0...@size).collect do |k|
- (0...@size).collect do |j|
- d_func(k,j)
- end
- end
- ]
- end
-
- ##
- # The initial value of the rate, which is of very importance for Newton
- # method. This is based on my huristics; the higher the win probablity of
- # a player is, the greater points he takes.
- #
- def initial_rate
- possibility =
- player_vector do |k|
- v = GSL::Vector[0, 0]
- each_player do |i|
- next if k == i
- v += GSL::Vector[@n[k,i], @n[i,k]]
- end
- v.nrm2 < 1 ? 0 : v[0] / (v[0] + v[1])
- end
- rank = possibility.sort_index
- @rate = player_vector do |k|
- K*500 * (rank[k]+1) / @size
- end
- average!
- end
-
- ##
- # Resets @rate as the higher the current win probablity of a player is,
- # the greater points he takes.
- #
- def initial_rate2
- @rate = @record.get || @rate
- rank = @rate.sort_index
- @rate = player_vector do |k|
- K*@count*1.5 * (rank[k]+1) / @size
- end
- average!
- end
-
- # mu is the deaccelrating parameter in Deaccelerated Newton method
- def deaccelrate(mu, old_rate, a, old_f_nrm2)
- @rate = old_rate - a * mu
- if func_vector.nrm2 < (1 - mu / 4.0 ) * old_f_nrm2 then
- return
- end
- if mu < 1e-4
- @record.set(func_vector.nrm2, @rate)
- initial_rate2
- return
- end
- $stderr.puts "mu: %f " % [mu] if $DEBUG
- deaccelrate(mu*0.5, old_rate, a, old_f_nrm2)
- end
-
- ##
- # Main process to calculate ratings.
- #
- def rating
- # Counter to stop the process.
- # Calulation in Newton method may fall in an infinite loop
- @count = 0
-
- # Main loop
- begin
- # Solve the equation:
- # J*a=f
- # @rate_(n+1) = @rate_(n) - a
- #
- # f.nrm2 should approach to zero.
- f = func_vector
- j = j_matrix
-
- # $stderr.puts "j: %s" % [j.inspect] if $DEBUG
- $stderr.puts "f: %s -> %f" % [f.to_a.inspect, f.nrm2] if $DEBUG
-
- # GSL::Linalg::LU.solve or GSL::Linalg::HH.solve would be available instead.
- #a = GSL::Linalg::HH.solve(j, f)
- a, = GSL::MultiFit::linear(j, f)
- a = self.class.average(a)
- # $stderr.puts "a: %s -> %f" % [a.to_a.inspect, a.nrm2] if $DEBUG
-
- # Deaccelerated Newton method
- # GSL::Vector object should be immutable.
- old_rate = @rate
- old_f = f
- old_f_nrm2 = old_f.nrm2
- deaccelrate(1.0, old_rate, a, old_f_nrm2)
- @record.set(func_vector.nrm2, @rate)
-
- $stderr.printf "|error| : %5.2e\n", a.nrm2 if $DEBUG
-
- @count += 1
- if @count > COUNT_MAX
- $stderr.puts "Values seem to oscillate. Stopped the process."
- $stderr.puts "f: %s -> %f" % [func_vector.to_a.inspect, func_vector.nrm2]
- break
- end
-
- end while (a.nrm2 > ERROR_LIMIT * @rate.nrm2)
-
- @rate = @record.get
- $stderr.puts "resolved f: %s -> %f" %
- [func_vector.to_a.inspect, func_vector.nrm2] if $DEBUG
-
- @rate *= 1.0/K
- finite!
- self
- end
-
- ##
- # Make the values of @rate finite.
- #
- def finite!
- @rate = @rate.collect do |a|
- if a.infinite?
- a.infinite? * AVERAGE_RATE * 100
- else
- a
- end
- end
- end
-
- ##
- # Flatten the values of @rate.
- #
- def average!(mean=0.0)
- @rate = self.class.average(@rate, mean)
- end
-
- ##
- # Translate by value
- #
- def translate!(value)
- @rate += value
- end
-
- ##
- # Make the values of @rate integer.
- #
- def integer!
- @rate = @rate.collect do |a|
- if a.finite?
- a.to_i
- elsif a.nan?
- 0
- elsif a.infinite?
- a.infinite? * AVERAGE_RATE * 100
- end
- end
- end
-end
-
-#################################################
-# Encapsulate a pair of keys and win loss matrix.
-# - keys is an array of player IDs; [gps+123, foo+234, ...]
-# - matrix holds games # where player i (row index) beats player j (column index).
-# The row and column indexes match with the keys.
-#
-# This object should be immutable. If an internal state is being modified, a
-# new object is always returned.
-#
-class WinLossMatrix
-
- ###############
- # Class methods
- #
-
- def self.mk_matrix(players)
- keys = players.keys.sort
- size = keys.size
- matrix =
- GSL::Matrix[*
- ((0...size).collect do |k|
- p1 = keys[k]
- p1_hash = players[p1]
- ((0...size).collect do |j|
- if k == j
- 0
- else
- p2 = keys[j]
- v = p1_hash[p2] || Vector[0,0]
- v[0]
- end
- end)
- end)]
- return WinLossMatrix.new(keys, matrix)
- end
-
- def self.mk_win_loss_matrix(players)
- obj = mk_matrix(players)
- return obj.filter
- end
-
- ##################
- # Instance methods
- #
-
- # an array of player IDs; [gps+123, foo+234, ...]
- attr_reader :keys
-
- # matrix holds games # where player i (row index) beats player j (column index).
- # The row and column indexes match with the keys.
- attr_reader :matrix
-
- def initialize(keys, matrix)
- @keys = keys
- @matrix = matrix
- end
-
- ##
- # Returns the size of the keys/matrix
- #
- def size
- if @keys
- @keys.size
- else
- nil
- end
- end
-
- ##
- # Removes players in a rows such as [1,3,5], and then returns a new
- # object.
- #
- def delete_rows(rows)
- rows = rows.sort.reverse
-
- copied_cols = []
- (0...size).each do |i|
- next if rows.include?(i)
- row = @matrix.row(i).clone
- rows.each do |j|
- row.delete_at(j)
- end
- copied_cols << row
- end
- if copied_cols.size == 0
- new_matrix = GSL::Matrix.new
- else
- new_matrix = GSL::Matrix[*copied_cols]
- end
-
- new_keys = @keys.clone
- rows.each do |j|
- new_keys.delete_at(j)
- end
-
- return WinLossMatrix.new(new_keys, new_matrix)
- end
-
- ##
- # Removes players who do not pass a criteria to be rated, and returns a
- # new object.
- #
- def filter
- $stderr.puts @keys.inspect if $DEBUG
- $stderr.puts @matrix.inspect if $DEBUG
- delete = []
- (0...size).each do |i|
- row = @matrix.row(i)
- col = @matrix.col(i)
- win = row.sum
- loss = col.sum
- if win < 1 || loss < 1 || win + loss < $GAMES_LIMIT
- delete << i
- end
- end
-
- # The recursion ends if there is nothing to delete
- return self if delete.empty?
-
- new_obj = delete_rows(delete)
- new_obj.filter
- end
-
- ##
- # Cuts self into connecting groups such as each player in a group has at least
- # one game with other players in the group. Returns them as an array.
- #
- def connected_subsets
- g = RGL::AdjacencyGraph.new
- (0...size).each do |k|
- (0...size).each do |i|
- next if k == i
- if @matrix[k,i] > 0
- g.add_edge(k,i)
- end
- end
- end
-
- subsets = []
- g.each_connected_component do |c|
- new_keys = []
- c.each do |v|
- new_keys << keys[v.to_s.to_i]
- end
- subsets << new_keys
- end
-
- subsets = subsets.sort {|a,b| b.size <=> a.size}
-
- result = subsets.collect do |keys|
- matrix =
- GSL::Matrix[*
- ((0...keys.size).collect do |k|
- p1 = @keys.index(keys[k])
- ((0...keys.size).collect do |j|
- if k == j
- 0
- else
- p2 = @keys.index(keys[j])
- @matrix[p1,p2]
- end
- end)
- end)]
- WinLossMatrix.new(keys, matrix)
- end
-
- return result
- end
-
- def to_s
- "size : #{@keys.size}" + "\n" +
- @keys.inspect + "\n" +
- @matrix.inspect
- end
-
-end
-
-
-#################################################
-# Main methods
-#
-
-# Half-life effect
-# After NHAFE_LIFE days value will get half.
-# 0.693 is constant, where exp(0.693) ~ 0.5
-def half_life(days)
- if days < $options["half-life-ignore"]
- return 1.0
- else
- Math::exp(-0.693/$options["half-life"]*(days-$options["half-life-ignore"]))
- end
-end
-
-def _add_win_loss(winner, loser, time)
- how_long_days = (Time.now - time)/(3600*24)
- $players[winner] ||= Hash.new { GSL::Vector[0,0] }
- $players[loser] ||= Hash.new { GSL::Vector[0,0] }
- $players[winner][loser] += GSL::Vector[1.0*half_life(how_long_days),0]
- $players[loser][winner] += GSL::Vector[0,1.0*half_life(how_long_days)]
-end
-
-def _add_time(player, time)
- $players_time[player] = time if $players_time[player] < time
-end
-
-def add(black_mark, black_name, white_name, white_mark, time)
- if black_mark == WIN_MARK && white_mark == LOSS_MARK
- _add_win_loss(black_name, white_name, time)
- elsif black_mark == LOSS_MARK && white_mark == WIN_MARK
- _add_win_loss(white_name, black_name, time)
- elsif black_mark == DRAW_MARK && white_mark == DRAW_MARK
- return
- else
- raise "Never reached!"
- end
- _add_time(black_name, time)
- _add_time(white_name, time)
-end
-
-def identify_id(id)
- if /@NORATE\+/ =~ id # the player having @NORATE in the name should not be rated
- return nil
- end
- id.gsub(/@.*?\+/,"+")
-end
-
-def grep(file)
- str = File.open(file).read
-
- if /^N\+(.*)$/ =~ str then black_name = $1.strip end
- if /^N\-(.*)$/ =~ str then white_name = $1.strip end
-
- if /^'summary:(.*)$/ =~ str
- state, p1, p2 = $1.split(":").map {|a| a.strip}
- return if state == "abnormal"
- p1_name, p1_mark = p1.split(" ")
- p2_name, p2_mark = p2.split(" ")
- if p1_name == black_name
- black_name, black_mark = p1_name, p1_mark
- white_name, white_mark = p2_name, p2_mark
- elsif p2_name == black_name
- black_name, black_mark = p2_name, p2_mark
- white_name, white_mark = p1_name, p1_mark
- else
- raise "Never reach!: #{black} #{white} #{p3} #{p2}"
- end
- end
- if /^'\$END_TIME:(.*)$/ =~ str
- time = Time.parse($1.strip)
- end
- if /^'rating:(.*)$/ =~ str
- black_id, white_id = $1.split(":").map {|a| a.strip}
- black_id = identify_id(black_id)
- white_id = identify_id(white_id)
- if black_id && white_id && (black_id != white_id) &&
- black_mark && white_mark
- $stdout.printf("%s %s %s %s %d\n", black_mark, black_id, white_id, white_mark, time)
- $stdout.flush
- end
- end
-end
-
-def usage
- $stderr.puts <<-EOF
-USAGE: #{$0} dir [...]
- EOF
- exit 1
-end
-
-def validate(yaml)
- yaml["players"].each do |group_key, group|
- group.each do |player_key, player|
- rate = player['rate']
- next unless rate
- if rate > 10000 || rate < -10000
- return false
- end
- end
- end
- return true
-end
-
-def usage(io)
- io.puts <<EOF
-USAGE: #{$0} [options] DIR..
- DIR where CSA files are looked up recursively
-OPTOINS:
- --half-life n [days] (default 60)
- --half-life-ignore m [days] (default 7)
- after m days, half-life effect works
- --fixed-rate-player player whose rate is fixed at the rate
- --fixed-rate rate
- --help show this message
-EOF
-end
-
-def main
- $options = Hash::new
- parser = GetoptLong.new(
- ["--half-life", GetoptLong::REQUIRED_ARGUMENT],
- ["--half-life-ignore", GetoptLong::REQUIRED_ARGUMENT],
- ["--help", "-h", GetoptLong::NO_ARGUMENT],
- ["--fixed-rate-player", GetoptLong::REQUIRED_ARGUMENT],
- ["--fixed-rate", GetoptLong::REQUIRED_ARGUMENT])
- parser.quiet = true
- begin
- parser.each_option do |name, arg|
- name.sub!(/^--/, '')
- $options[name] = arg.dup
- end
- if ( $options["fixed-rate-player"] && !$options["fixed-rate"]) ||
- (!$options["fixed-rate-player"] && $options["fixed-rate"]) ||
- ( $options["fixed-rate-player"] && $options["fixed-rate"].to_i <= 0)
- usage($stderr)
- exit 1
- end
- rescue
- usage($stderr)
- raise parser.error_message
- end
- if $options["help"]
- usage($stdout)
- exit 0
- end
- $options["half-life"] ||= 60
- $options["half-life"] = $options["half-life"].to_i
- $options["half-life-ignore"] ||= 7
- $options["half-life-ignore"] = $options["half-life-ignore"].to_i
- $options["fixed-rate"] = $options["fixed-rate"].to_i if $options["fixed-rate"]
-
- if ARGV.empty?
- while line = $stdin.gets do
- next unless %r!.*\.csa$! =~ line
- grep line.strip
- end
- else
- while dir = ARGV.shift do
- Dir.glob( File.join(dir, "**", "*.csa") ) {|f| grep(f)}
- end
- end
- $stderr.puts "read done."
-end
-
-if __FILE__ == $0
- main
-end
-
-# vim: ts=2 sw=2 sts=0
Sat 22:00
Sun 13:00
+ PAREMETER SETTING
+
+ In addition, this configuration file allows to set parameters
+ for the specific Floodaget group. A list of parameters is the
+ following:
+
+ * pairing_factory:
+ Specifies a factory function name generating a pairing
+ method which will be used in a specific Floodgate game.
+ ex. set pairing_factory floodgate_zyunisen
+ * sacrifice:
+ Specifies a sacrificed player.
+ ex. set sacrifice gps500+e293220e3f8a3e59f79f6b0efffaa931
+
LICENSE
GPL versoin 2 or later
#
attr_reader :next_time
attr_reader :league, :game_name
+ attr_reader :pairing_factory
+ attr_reader :options
def initialize(league, hash={})
@league = league
@next_time = hash[:next_time] || nil
@game_name = hash[:game_name] || "floodgate-900-0"
+ @pairing_factory = "default_factory" # will be updated by NextTimeGenerator
+ # Options will be updated by NextTimeGenerator
+ @options = {:sacrifice => "gps500+e293220e3f8a3e59f79f6b0efffaa931"}
charge if @next_time.nil?
end
def charge
ntg = NextTimeGenerator.factory(@game_name)
+ @pairing_factory = ntg.pairing_factory
+ @options[:sacrifice] = ntg.sacrifice
if ntg
@next_time = ntg.call(Time.now)
else
end
def match_game
+ log_message("Starting Floodgate games...: %s, %s" % [@game_name, @pairing_factory])
players = @league.find_all_players do |pl|
pl.status == "game_waiting" &&
game_name?(pl.game_name) &&
pl.sente == nil
end
- Pairing.match(players)
+ logics = Pairing.send(@pairing_factory, @options)
+ Pairing.match(players, logics)
end
#
end
end
+ class AbstructNextTimeGenerator
+
+ attr_reader :pairing_factory
+ attr_reader :sacrifice
+
+ # Constructor.
+ #
+ def initialize
+ @pairing_factory = "default_factory"
+ @sacrifice = "gps500+e293220e3f8a3e59f79f6b0efffaa931"
+ end
+ end
+
# Schedule the next time from configuration files.
#
# Line format:
# # This is a comment line
+ # set <parameter_name> <value>
# DoW Time
# ...
# where
# Sat 22:00
# Sun 13:00
#
- class NextTimeGeneratorConfig
+ # Set parameters:
+ #
+ # * pairing_factory:
+ # Specifies a factory function name generating a pairing
+ # method which will be used in a specific Floodgate game.
+ # ex. set pairing_factory floodgate_zyunisen
+ # * sacrifice:
+ # Specifies a sacrificed player.
+ # ex. set sacrifice gps500+e293220e3f8a3e59f79f6b0efffaa931
+ #
+ class NextTimeGeneratorConfig < AbstructNextTimeGenerator
# Constructor.
# Read configuration contents.
#
def initialize(lines)
+ super()
@lines = lines
end
# now.cweek 1-53
# now.cwday 1(Monday)-7
@lines.each do |line|
- if %r!^\s*(\w+)\s+(\d{1,2}):(\d{1,2})! =~ line
+ case line
+ when %r!^\s*set\s+pairing_factory\s+(\w+)!
+ @pairing_factory = $1
+ when %r!^\s*set\s+sacrifice\s+(.*)!
+ @sacrifice = $1
+ when %r!^\s*(\w+)\s+(\d{1,2}):(\d{1,2})!
dow, hour, minute = $1, $2.to_i, $3.to_i
dow_index = ::ShogiServer::parse_dow(dow)
next if dow_index.nil?
time = DateTime::commercial(now.cwyear, now.cweek, dow_index, hour, minute) rescue next
time += 7 if time <= now
candidates << time
+ when %r!^\s*#!
+ # Skip comment line
+ when %r!^\s*$!
+ # Skip empty line
+ else
+ log_warning("Floodgate: Unsupported syntax in a next time generator config file: %s" % [line])
end
end
candidates.map! {|dt| ::ShogiServer::datetime2time(dt)}
# Schedule the next time for floodgate-900-0: each 30 minutes
#
- class NextTimeGenerator_Floodgate_900_0
+ class NextTimeGenerator_Floodgate_900_0 < AbstructNextTimeGenerator
+
+ # Constructor.
+ #
+ def initialize
+ super
+ end
+
def call(now)
if now.min < 30
return Time.mktime(now.year, now.month, now.day, now.hour, 30)
# Schedule the next time for floodgate-3600-0: each 2 hours (odd hour)
#
- class NextTimeGenerator_Floodgate_3600_0
+ class NextTimeGenerator_Floodgate_3600_0 < AbstructNextTimeGenerator
+
+ # Constructor.
+ #
+ def initialize
+ super
+ end
+
def call(now)
return Time.mktime(now.year, now.month, now.day, now.hour) + ((now.hour%2)+1)*3600
end
# Schedule the next time for debug: each 30 seconds.
#
- class NextTimeGenerator_Debug
+ class NextTimeGenerator_Debug < AbstructNextTimeGenerator
+
+ # Constructor.
+ #
+ def initialize
+ super
+ end
+
def call(now)
if now.sec < 30
return Time.mktime(now.year, now.month, now.day, now.hour, now.min, 30)
end
def start_games(floodgate)
- log_message("Starting Floodgate games...: %s" % [floodgate.game_name])
$league.reload
floodgate.match_game
end
#
def regenerate_leagues(next_array)
leagues = next_array.collect do |game_name, next_time|
+ log_message("Regenerating a floodgate league...: %s %s" % [game_name, next_time])
floodgate = ShogiServer::League::Floodgate.new($league,
{:game_name => game_name,
:next_time => next_time})
class Pairing
class << self
- def default_factory
- return least_diff_pairing
+ def default_factory(options)
+ return least_diff_pairing(options)
end
- def sort_by_rate_with_randomness
+ def sort_by_rate_with_randomness(options)
return [LogPlayers.new,
- ExcludeSacrificeGps500.new,
+ ExcludeSacrifice.new(options[:sacrifice]),
MakeEven.new,
SortByRateWithRandomness.new(1200, 2400),
StartGameWithoutHumans.new]
end
- def random_pairing
+ def random_pairing(options)
return [LogPlayers.new,
- ExcludeSacrificeGps500.new,
+ ExcludeSacrifice.new(options[:sacrifice]),
MakeEven.new,
Randomize.new,
StartGameWithoutHumans.new]
end
- def swiss_pairing
+ def swiss_pairing(options)
return [LogPlayers.new,
- ExcludeSacrificeGps500.new,
+ ExcludeSacrifice.new(options[:sacrifice]),
MakeEven.new,
Swiss.new,
StartGameWithoutHumans.new]
end
- def least_diff_pairing
+ def least_diff_pairing(options)
return [LogPlayers.new,
- ExcludeSacrificeGps500.new,
+ ExcludeSacrifice.new(options[:sacrifice]),
MakeEven.new,
LeastDiff.new,
StartGameWithoutHumans.new]
end
- def match(players)
- logics = default_factory
+ def floodgate_zyunisen(options)
+ return [LogPlayers.new,
+ ExcludeUnratedPlayers.new,
+ ExcludeSacrifice.new(options[:sacrifice]),
+ MakeEven.new,
+ LeastDiff.new,
+ StartGameWithoutHumans.new]
+ end
+
+ def match(players, logics)
logics.inject(players) do |result, item|
item.match(result)
result
def match(players)
super
if players.size < 2
- log_warning("Floodgate: There should be more than one player (%d)." % [players.size])
+ log_message("Floodgate: There are less than two players: %d" % [players.size])
return
end
if players.size.odd?
super
log_players(players)
if players.size < 2
- log_warning("Floodgate: There should be more than one player (%d)." % [players.size])
+ log_message("Floodgate: There are less than two players: %d" % [players.size])
return
elsif players.size == 2
start_game_shuffle(players)
# @sacrifice a player id to be eliminated
def initialize(sacrifice)
super()
- @sacrifice = sacrifice
+ @sacrifice = sacrifice || "gps500+e293220e3f8a3e59f79f6b0efffaa931"
end
def match(players)
players.shuffle
end
- # Returns a player's rate value.
+ # Update estimated rate of a player.
# 1. If it has a valid rate, return the rate.
- # 2. If it has no valid rate, return average of the following values:
- # a. For games it won, the opponent's rate + 100
- # b. For games it lost, the opponent's rate - 100
- # (if the opponent has no valid rate, count out the game)
- # (if there are not such games, return 2150 (default value)
+ # 2. If it has no valid rate, return:
+ # a. If it won the last game, the opponent's rate + 200
+ # b. If it lost the last game, the opponent's rate - 200
+ # c. otherwise, return 2150 (default value)
#
- def get_player_rate(player, history)
- return player.rate if player.rate != 0
- return 2150 unless history
-
- count = 0
- sum = 0
-
- history.win_games(player.player_id).each do |g|
- next unless g[:loser]
- name = g[:loser].split("+")[0]
- p = $league.find(name)
- if p && p.rate != 0
- count += 1
- sum += p.rate + 100
- end
+ def estimate_rate(player, history)
+ player.estimated_rate = 2150 # default value
+
+ unless history
+ log_message("Floodgate: Without game history, estimated %s's rate: %d" % [player.name, player.estimated_rate])
+ return
end
- history.loss_games(player.player_id).each do |g|
- next unless g[:winner]
- name = g[:winner].split("+")[0]
- p = $league.find(name)
- if p && p.rate != 0
- count += 1
- sum += p.rate - 100
- end
+
+ g = history.last_valid_game(player.player_id)
+ unless g
+ log_message("Floodgate: Without any valid games in history, estimated %s's rate: %d" % [player.name, player.estimated_rate])
+ return
+ end
+
+ opponent_id = nil
+ win = true
+ case player.player_id
+ when g[:winner]
+ opponent_id = g[:loser]
+ win = true
+ when g[:loser]
+ opponent_id = g[:winner]
+ win = false
+ else
+ log_warning("Floodgate: The last valid game is invalid for %s!" % [player.name])
+ log_message("Floodgate: Estimated %s's rate: %d" % [player.name, player.estimated_rate])
+ return
+ end
+
+ opponent_name = opponent_id.split("+")[0]
+ p = $league.find(opponent_name)
+ unless p
+ log_message("Floodgate: No active opponent found. Estimated %s's rate: %d" % [player.name, player.estimated_rate])
+ return
end
- estimate = (count == 0 ? 2150 : sum/count)
- log_message("Floodgate: Estimated rate of %s is %d" % [player.name, estimate])
- return estimate
+ opponent_rate = 0
+ if p.rate != 0
+ opponent_rate = p.rate
+ elsif p.estimated_rate != 0
+ opponent_rate = p.estimated_rate
+ end
+
+ if opponent_rate != 0
+ player.estimated_rate = opponent_rate + (win ? 200 : -200)
+ end
+
+ log_message("Floodgate: Estimated %s's rate: %d" % [player.name, player.estimated_rate])
+ end
+
+ # Return a player's rate based on its actual rate or estimated rate.
+ #
+ def get_player_rate(player, history)
+ if player.rate != 0
+ return player.rate
+ elsif player.estimated_rate != 0
+ return player.estimated_rate
+ else
+ estimate_rate(player, history)
+ return player.estimated_rate
+ end
end
def calculate_diff_with_penalty(players, history)
return players
end
+ # Reset estimated rate
+ players.each {|p| p.estimated_rate = 0}
+
# 10 trials
matches = []
scores = []
min_score = s
end
end
- log_message("Floodgate: the least score %d (%d per player) [%s]" % [min_score, min_score/players.size, scores.join(" ")])
+ log_message("Floodgate: the least score %d (%d per game) [%s]" % [min_score, min_score/players.size*2, scores.join(" ")])
players.replace(matches[min_index])
end
end
+ # This pairing method excludes unrated players
+ #
+ class ExcludeUnratedPlayers < Pairing
+
+ def match(players)
+ super
+
+ log_message("Floodgate: Deleting unrated players...")
+ players.delete_if{|a| a.rate == 0}
+ log_players(players)
+ end
+ end # class ExcludeUnratedPlayers
+
end # ShogiServer
@name = nil
@password = nil
@rate = 0
+ @estimated_rate = 0
@win = 0
@loss = 0
@last_game_win = false
# Score in the rating sysem
attr_accessor :rate
+ # Estimated rate for unrated player (rate == 0)
+ # But this value is not persisted and cleared when player logs off.
+ attr_accessor :estimated_rate
+
# Number of games for win and loss in the rating system
attr_accessor :win, :loss
require 'shogi_server'
require 'shogi_server/league/floodgate'
require 'fileutils'
+require 'test/mock_log_message'
$topdir = File.expand_path File.dirname(__FILE__)
def setup
end
+ def test_comment
+ now = DateTime.new(2010, 6, 10, 21, 59, 59) # Thu
+ lines = %w(#\ comment1 Thu\ 22:00 #\ comment2)
+ ntc = ShogiServer::League::Floodgate::NextTimeGeneratorConfig.new lines
+ assert_equal Time.parse("10-06-2010 22:00"), ntc.call(now)
+ end
+
+ def test_empty_line
+ now = DateTime.new(2010, 6, 10, 21, 59, 59) # Thu
+ lines = %w(\ Thu\ 22:00 \ hoge)
+ ntc = ShogiServer::League::Floodgate::NextTimeGeneratorConfig.new lines
+ assert_equal Time.parse("10-06-2010 22:00"), ntc.call(now)
+ end
+
def test_read
now = DateTime.new(2010, 6, 10, 21, 20, 15) # Thu
assert_equal DateTime.parse("10-06-2010 21:20:15"), now
ntc = ShogiServer::League::Floodgate::NextTimeGeneratorConfig.new ["Thu 22:00"]
assert_equal Time.parse("17-06-2010 22:00"), ntc.call(now)
end
+
+ def test_default_pairing_factory
+ now = DateTime.new(2010, 6, 10, 21, 59, 59) # Thu
+ lines = %w(Thu\ 22:00)
+ ntc = ShogiServer::League::Floodgate::NextTimeGeneratorConfig.new lines
+ assert_equal Time.parse("10-06-2010 22:00"), ntc.call(now)
+ assert_equal("default_factory", ntc.pairing_factory)
+ end
+
+ def test_read_pairing_factory
+ now = DateTime.new(2010, 6, 10, 21, 59, 59) # Thu
+ lines = %w(set\ pairing_factory\ least_diff_pairing Thu\ 22:00)
+ ntc = ShogiServer::League::Floodgate::NextTimeGeneratorConfig.new lines
+ assert_equal Time.parse("10-06-2010 22:00"), ntc.call(now)
+ assert_equal("least_diff_pairing", ntc.pairing_factory)
+ end
+
+ def test_default_sacrifice
+ now = DateTime.new(2010, 6, 10, 21, 59, 59) # Thu
+ lines = %w(Thu\ 22:00)
+ ntc = ShogiServer::League::Floodgate::NextTimeGeneratorConfig.new lines
+ assert_equal Time.parse("10-06-2010 22:00"), ntc.call(now)
+ assert_equal("gps500+e293220e3f8a3e59f79f6b0efffaa931", ntc.sacrifice)
+ end
+
+ def test_read_sacrifice
+ now = DateTime.new(2010, 6, 10, 21, 59, 59) # Thu
+ lines = %w(set\ sacrifice\ yowai_gps+95908f6c18338f5340371f71523fc5e3 Thu\ 22:00)
+ ntc = ShogiServer::League::Floodgate::NextTimeGeneratorConfig.new lines
+ assert_equal Time.parse("10-06-2010 22:00"), ntc.call(now)
+ assert_equal("yowai_gps+95908f6c18338f5340371f71523fc5e3", ntc.sacrifice)
+ end
end
def test_get_player_rate_0
assert_equal(2150, @pairing.get_player_rate(@x, @history))
+ @x.estimated_rate = 0
dummy = nil
def @history.make_record(game_result)
{:game_id => "wdoor+floodgate-900-0-x-a-1",
:winner => "x", :loser => "a"}
end
@history.update(dummy)
- assert_equal(@a.rate+100, @pairing.get_player_rate(@x, @history))
+ assert_equal(@a.rate+200, @pairing.get_player_rate(@x, @history))
+ @x.estimated_rate = 0
def @history.make_record(game_result)
{:game_id => "wdoor+floodgate-900-0-x-b-1",
:black => "x", :white => "b",
end
@history.update(dummy)
- assert_equal((@a.rate+100+@b.rate-100)/2, @pairing.get_player_rate(@x, @history))
+ assert_equal(@b.rate-200, @pairing.get_player_rate(@x, @history))
end
end
+class TestExcludeUnratedPlayers < Test::Unit::TestCase
+ def setup
+ @pairing= ShogiServer::ExcludeUnratedPlayers.new
+ @a = ShogiServer::BasicPlayer.new
+ @a.name = "a"
+ @a.win = 1
+ @a.loss = 2
+ @a.rate = 0
+ @b = ShogiServer::BasicPlayer.new
+ @b.name = "b"
+ @b.win = 10
+ @b.loss = 20
+ @b.rate = 1500
+ @c = ShogiServer::BasicPlayer.new
+ @c.name = "c"
+ @c.win = 100
+ @c.loss = 200
+ @c.rate = 1000
+ @d = ShogiServer::BasicPlayer.new
+ @d.name = "d"
+ @d.win = 1000
+ @d.loss = 2000
+ @d.rate = 2000
+ end
+
+ def test_match_without_any_players
+ players = []
+ @pairing.match(players)
+ assert_equal([], players)
+ end
+
+ def test_match_without_unrated_player_1
+ players = [@b, @c, @d]
+ @pairing.match(players)
+ assert_equal([@b, @c, @d], players)
+ end
+
+ def test_match_without_unrated_player_2
+ players = [@b]
+ @pairing.match(players)
+ assert_equal([@b], players)
+ end
+
+ def test_match_with_unrated_player_1
+ players = [@a, @b, @c, @d]
+ @pairing.match(players)
+ assert_equal([@b, @c, @d], players)
+ end
+
+ def test_match_with_unrated_player_2
+ players = [@a]
+ @pairing.match(players)
+ assert_equal([], players)
+ end
+end
OSDN Git Service
