[QUIZ][SOLUTION] Kalah (#58)

D

David Balmain

Hey guys,

Here's my solution to this weeks Ruby quiz. I used the MTD(f) algorithm.

http://en.wikipedia.org/wiki/MTD(f)

Unfortunately I couldn't seem to get my transposition tables to work
correctly. The garbage collector kept crashing. I think that to get a
solution like this to work well you need to store the transposition
tables on disk. Pity I haven't finished cFerret yet.

By the way, I'm afraid my solution probably isn't very Rubyish. You
can probably tell I've been doing a lot of C coding lately. If anyone
wants to clean it up and improve it, please do and let me know about
it. :)

Looking forward to seeing some other solutions.

Cheers,
Dave

See a syntax coloured version here;

http://www.davebalmain.com/pages/kalah


require 'player'

class Dave < Player
START_BOARD =3D [4,4,4,4,4,4,0,4,4,4,4,4,4,0]

Bounds =3D Struct.new:)lower, :upper, :lower_move, :upper_move)

def initialize(name, depth =3D [6,8])
super(name)
@depth =3D depth
@guess =3D 0
@transposition_table =3D {}
@previous_transposition_table =3D {}
end

def choose_move
board =3D @game.board
# start move is always the same;
if board =3D=3D START_BOARD
# we are first to go
@guess =3D 8
@move_list =3D [5]
return 2
elsif board[13] =3D=3D 0 and @game.player_to_move =3D=3D KalahGame::TOP
# we are second to go
@guess =3D -9
return 9 if board[9] =3D=3D 4
return 8
end


return @move_list.pop if @move_list and @move_list.size > 0

# If the next move is from the top then we rotate the board so that all
# operations would be the same as if we were playing from the bottom
if (@game.player_to_move =3D=3D KalahGame::TOP)
# We do iterative deepening here. Unfortunately, due to memory
# constraints, the transpositon table has to be reset every turn so w=
e
# can't go very deep. For a depth of 8, one step seems to be the same=
as
# two but we'll keep it for demonstration purposes.
@depth.each do |depth|
@guess, @move_list =3D mtdf(board[7,7] + board[0,7], @guess, depth)
@previous_transposition_table =3D @transposition_table
@transposition_table =3D {}
end
@move_list.size.times {|i| @move_list +=3D 7}
else
@depth.each do |depth|
@guess, @move_list =3D mtdf(board.dup, @guess, depth)
@previous_transposition_table =3D @transposition_table
@transposition_table =3D {}
end
end
return @move_list.pop
end

def make_move(move, board)
stones =3D board[move]
board[move] =3D 0

pos =3D move
while stones > 0
pos +=3D 1
pos =3D 0 if pos=3D=3D13
board[pos] +=3D 1
stones -=3D 1
end

if(pos.between?(0,5) and board[pos] =3D=3D 1)
board[6] +=3D board[12-pos] + 1
board[12-pos] =3D board[pos] =3D 0
end
board
end

def game_over?(board)
top =3D bottom =3D true
(7..12).each { |i| top =3D false if board > 0 }
(0.. 5).each { |i| bottom =3D false if board > 0 }
top or bottom
end

def game_over_score(board)
score =3D 0
(0.. 6).each { |i| score +=3D board }
(7..13).each { |i| score -=3D board }
return score
end

def mtdf(game, guess, depth)
upper =3D 1000
lower =3D -1000
move =3D -1

begin
alpha =3D (guess =3D=3D upper) ? guess - 1 : guess
guess, move =3D alpha_beta(game, alpha, alpha + 1, depth)
if guess > alpha
best_move =3D move
lower =3D guess
else
upper =3D guess
end
end while lower < upper

return guess, best_move
end

def alpha_beta(board, lower, upper, depth)
# Check the transposition table to see if we've tried this board before
if (bounds =3D @transposition_table[board])
return bounds.lower, bounds.lower_move if bounds.lower >=3D upper
return bounds.upper, bounds.upper_move if bounds.upper <=3D lower

# last time we were with these bounds so use the same position that w=
e
# found last time
first_move =3D (bounds.upper_move||bounds.lower_move).last
else
# We haven't tried this board before during this round
bounds =3D @transposition_table[board] =3D Bounds.new(-1000, 1000, ni=
l, nil)

# If we tried this board in a previous round see what move was found =
to
# be the best. We'll try it first.
if (prev_bounds =3D @previous_transposition_table[board])
first_move =3D (prev_bounds.upper_move||prev_bounds.lower_move).las=
t
end
end

if (game_over?(board))
guess =3D game_over_score(board)
best =3D []
elsif (depth =3D=3D 0)
guess =3D board[6] - board[13]
best =3D []
else
best =3D -1
guess =3D -1000
moves =3D []

(0..5).each do |i|
next if board =3D=3D 0
if board =3D=3D 6-i
moves.unshift(i)
else
moves.push(i)
end
end
# move the previous best move for this board to the front
if first_move and first_move !=3D moves[0]
moves.delete(first_move)
moves.unshift(first_move)
end

moves.each do |i|
next_board =3D make_move(i, board.dup)
if board =3D=3D 6-i
next_guess, move_list =3D alpha_beta(next_board, lower, upper, de=
pth)
else
next_guess, =3D alpha_beta(next_board[7,7] + next_board[0,7],
0-upper, 0-lower, depth - 1)

next_guess *=3D -1
move_list =3D []
end
if (next_guess > guess)
guess =3D next_guess
best =3D move_list +
# beta pruning
break if (guess >=3D upper)
end
#lower =3D guess if (guess > lower)
end
end

# record the upper or lower bounds for this position if we have found a
# new best bound
if guess <=3D lower
bounds.upper =3D guess
bounds.upper_move =3D best
end
if guess >=3D upper
bounds.lower =3D guess
bounds.lower_move =3D best
end
return guess, best
end
end
 
A

Adam Shelly

------=_Part_1773_7619312.1134419167836
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
Content-Disposition: inline

Here are my Kalah Players.
My first trick was to create subclass of Player so that my players are
always playing from bins 0..5. This got rid of a lot of messy
conditions. It also contains a move simulator.

AdamsPlayers.rb contains some very simple test players, as well as 2
reasonably good players:
DeepScoreKalahPlayer tries to find the biggest gain in points for a
single move, and APessimisticKalahPlayer does the same, but subtracts
the opponent's best possible next move.

AHistoryPlayer.rb contains a player which ranks the results of each
move, and keeps a history. The idea is that the more it plays, the
less likely it is to choose bad moves.
It stores the history in a Yaml file, which definitely causes a
slowdown as it gets bigger.
That's one thing I'd like to improve if I have time. I also added a
line to the game engine to report the final score back to the players.
AHistoryPlayer still works without it, but it's less accurate I
think, since it never records the final result.

None of these players pay much attention to the number of stones
remaining on the opponent's side, which is one factor in why they fail
miserably against Dave's player. But they do tend to beat Rob's
players. I'm hoping some more people submit solutions.

Add your players to TestMatch.rb to run them in a roundRobin

-Adam

------=_Part_1773_7619312.1134419167836
Content-Type: application/x-ruby; name=AdamsPlayers.rb
Content-Transfer-Encoding: 7bit
Content-Disposition: attachment; filename="AdamsPlayers.rb"


#Adapter class - rotates the board so that player's Kalah is always 6
class KalahPlayer < Player
def choose_move
n = (@side==KalahGame::TOP) ? 7 : 0
@board = @game.board
@board = @board.rotate n
return get_move + n
end

#simulate a move
def simulate board,i
b = board.dup
stones,b=b,0
while stones > 0
i = 0 if (i+=1) >12
b+=1
stones-=1
end
if (0..5)===i and b==1
b[6]+= (b+b[opposite(i)])
b=b[opposite(i)]=0
end
b
end
def opposite n
12-n
end

end

#Some helpers in Array
class Array
def rotate n
a =dup
n.times do a << a.shift end
a
end
def sum
inject(0){|s,e|s+=e}
end
#choose randomly between all items with given value
def random_index value
n=rand(find_all{|e|e==value}.size)
each_with_index{|e,i| return i if e==value and (n-=1)<0 }
end
end

#### Some simple players for testing:
class RemoveRightKalahPlayer < KalahPlayer
def get_move
5.downto(0) {|i| return i if @board>0 }
end
end
class RemoveHighKalahPlayer < KalahPlayer
def get_move
myboard = @board[0,6]
myboard.index(myboard.max)
end
end
class RemoveRandomHighKalahPlayer < KalahPlayer
def get_move
myboard = @board[0,6]
myboard.random_index(myboard.max)
end
end
class RemoveLowKalahPlayer < KalahPlayer
def get_move
myboard = @board[0,6].select{|e| e>0}
@board[0,6].index(myboard.min)
end
end
class RemoveRandomLowKalahPlayer < KalahPlayer
def get_move
myboard = @board[0,6].select{|e| e>0}
@board[0,6].random_index(myboard.min)
end
end

class ScoreKalahPlayer < KalahPlayer
def get_move
possible_scores = (0..5).map{|i| score_for i}
possible_scores.index(possible_scores.max)
end
def score_for i
return -1 if @board == 0
simulate(@board,i)[6]-@board[6]
end
end


### Some better players

#Tries to find the biggest increase in score for a turn
class DeepScoreKalahPlayer < KalahPlayer
def get_move
best_move(@board)
end
def best_move board
possible_scores = (0..5).map{|i| score_for(board,i)}
possible_scores.index(possible_scores.max)
end

#find the increase in score if we make move m
def score_for board,m
return -100 if board[m]<1 #flag invalid move
b, taketurn = board,true
while taketurn
taketurn = ((b[m]+m)%14 == 6) #will we land in kalah?
b = simulate b,m
i = best_move(b) if taketurn
end
b[6]-board[6] #how many points did we gain?
end

end


#Tries to find the biggest increase in score for a turn
#subtracts opponent's possible score
class APessimisticKalahPlayer < DeepScoreKalahPlayer
MaxDepth = 4
def get_move
@level=0
best_move(@board)
end
def best_move board
return super(board) if (@level > MaxDepth)
@level+=1
possible_scores = (0..5).map{|i|
score_for(board,i) - worst_case(simulate(board,i))
}
@level-=1
possible_scores.random_index(possible_scores.max)
end
#biggest score the opponent can get on this board
def worst_case board
worst = 0
opp_board = board.rotate 7
6.times {|i|
s = score_for(opp_board, i)
worst = s if worst < s
}
worst
end
end




------=_Part_1773_7619312.1134419167836
Content-Type: application/x-ruby; name=AHistoryPlayer.rb
Content-Transfer-Encoding: 7bit
Content-Disposition: attachment; filename="AHistoryPlayer.rb"

require 'AdamsPlayers.rb'
require 'yaml'

HistoryFile = "ads_khist.yaml"

class WeightedAverage
def initialize window
@store = []
@size = window
end
def add item, weight
@store.shift if @store.size > @size
@store << [item,weight]
self
end
def ave
totweight = 0
@store.inject(0){|sum,e| totweight+=e.last; sum+e.first*e.last}/(totweight.to_f)
end
end

class AHistoryKalahPlayer <APessimisticKalahPlayer
def initialize name
super
@db = load
@stack=[]
@myside = nil
end
def reset
@stack=[]
@myside = @side
save HistoryFile
end

def get_move
update_scores @board
@level=0
scores = db_fetch(@board)
if scores.sum !=0 #there is data in the record
scorez = scores.zip((0..5).to_a).sort.reverse
m = scorez.first.last
end
while m && @board[m]==0
scorez.shift
m = scorez.first.last if !scorez.empty?
end
m = best_move(@board) if !m
@stack << [@board,m,WeightedAverage.new(16).add(scores[m],2)]
save HistoryFile if game_almost_over? simulate(@board,m)
m
end
def scoreboard b
b[6]-b[13]
end
def update_scores board
reset if @side!=@myside
score = scoreboard board
(1..16).each do |n|
break if n > @stack.size
oldboard,move,wave = @stack[-n]
delta = score-scoreboard(oldboard) #did we improve or worsen our relative score?
db_update(oldboard,move,wave.add(delta,1/Math::sqrt(n)).ave) #record it, weighted by age
end
end
def game_almost_over? board
!board[0..5].find{|e| e>0} || board[7..12].find_all{|e| e>0}.size <1
end
def key board
(board[0..5]+board[7..12]).join('-')
end
def db_fetch board
@db[key(board)]||=Array.new(6){0}
end
def db_update board,move,score
a = db_fetch board
a[move]=score
end

def load
if File.exists? HistoryFile
File.open( HistoryFile,"rb+"){|f| YAML::load(f) }
else
{}
end
end
def save name
File.open( name, 'wb' ) {|f| f<< (@db.to_yaml)}
end

#I added the following lines to the bottom of KalahGame#play_game so that I could get better scoring.
#>> top.notify_over [top_score,bottom_score] if top.respond_to? :notify_over
#>> bottom.notify_over [bottom_score, top_score] if bottom.respond_to? :notify_over
#This player still works without these.
def notify_over score
final = Array.new(14){0}
final[6]=score[0]
final[13]=score[1]
update_scores final
end

end



------=_Part_1773_7619312.1134419167836
Content-Type: application/x-ruby; name=KalahMatch.rb
Content-Transfer-Encoding: 7bit
Content-Disposition: attachment; filename="KalahMatch.rb"

class Player
attr_accessor :name
attr_writer :game, :side

def initialize( name )
@name = name
end

def choose_move
if @side==KalahGame::TOP
(7..12).each { |i| return i if @game.stones_at?(i) > 0 }
else
(0..5).each { |i| return i if @game.stones_at?(i) > 0 }
end
end
end

class HumanPlayer < Player
def choose_move
print 'Enter your move choice: '
gets.chomp.to_i
end
end


class KalahMatch
def start( p1, p2 )
puts ''
puts '========== GAME 1 =========='
p1_score_1, p2_score_1 = KalahGame.new.play_game( p1, p2 )

if p1_score_1 > p2_score_1
puts p1.name+' won game #1: '+p1_score_1.to_s+'-'+p2_score_1.to_s
elsif p2_score_1 > p1_score_1
puts p2.name+' won game #1: '+p2_score_1.to_s+'-'+p1_score_1.to_s
else
puts 'game #1 was a tie: '+p1_score_1.to_s+'-'+p2_score_1.to_s
end

puts ''
puts '========== GAME 2 =========='
p2_score_2, p1_score_2 = KalahGame.new.play_game( p2, p1 )

if p1_score_2 > p2_score_2
puts p1.name+' won game #2: '+p1_score_2.to_s+'-'+p2_score_2.to_s
elsif p2_score_2 > p1_score_2
puts p2.name+' won game #2: '+p2_score_2.to_s+'-'+p1_score_2.to_s
else
puts 'game #2 was a tie: '+p1_score_2.to_s+'-'+p2_score_2.to_s
end

puts ''
puts '========== FINAL =========='

p1_final = p1_score_1+p1_score_2
p2_final = p2_score_1+p2_score_2

if p1_final > p2_final
puts p1.name+' won the match: '+p1_final.to_s+'-'+p2_final.to_s
elsif p2_final > p1_final
puts p2.name+' won the match: '+p2_final.to_s+'-'+p1_final.to_s
else
puts 'the match was tied overall : '+p1_final.to_s+'-'+p2_final.to_s
end
end
end

class KalahGame
NOBODY = 0
TOP = 1
BOTTOM = 2

attr_reader :board, :player_to_move

def initialize_copy(other_game)
super
@board = other_game.board.dup
end

def stones_at?( i )
@board
end

def legal_move?( move )
( ( @player_to_move==TOP and move >= 7 and move <= 12 ) ||
( @player_to_move==BOTTOM and move >= 0 and move <= 5 ) ) and @board[move] != 0
end

def game_over?
top = bottom = true
(7..12).each { |i| top = false if @board > 0 }
(0..5).each { |i| bottom = false if @board > 0 }
top or bottom
end

def winner
top, bottom = top_score, bottom_score
if top > bottom
return TOP
elsif bottom > top
return BOTTOM
else
return NOBODY
end
end

def top_score
score = 0
(7..13).each { |i| score += @board }
score
end

def bottom_score
score = 0
(0..6).each { |i| score += @board }
score
end

def make_move( move )
( puts 'Illegal move...' ; return ) unless legal_move?( move )

stones, @board[move] = @board[move], 0

pos = move+1
while stones > 0
pos+=1 if( (@player_to_move==TOP and pos==6) || (@player_to_move==BOTTOM and pos==13) )
pos = 0 if pos==14
@board[pos]+=1
stones-=1
pos+=1 if stones > 0
end

if( @player_to_move==TOP and pos>6 and pos<13 and @board[pos]==1 )
@board[13] += @board[12-pos]+1
@board[12-pos] = @board[pos] = 0
elsif( @player_to_move==BOTTOM and pos>=0 and pos<6 and @board[pos]==1 )
@board[6] += @board[12-pos]+1
@board[12-pos] = @board[pos] = 0
end

if @player_to_move==TOP
@player_to_move = BOTTOM unless pos == 13
else
@player_to_move=TOP unless pos == 6
end

end

def display
puts ''
top = ' '
[12,11,10,9,8,7].each { |i| top += @board.to_s+' ' }
puts top
puts @board[13].to_s + ' ' + @board[6].to_s
bottom = ' '
(0..5).each { |i| bottom += @board.to_s+' ' }
puts bottom
puts ''
end

def reset
@board = Array.new( 14, 4 )
@board[6] = @board[13] = 0
@player_to_move = BOTTOM
end

def play_game( bottom, top )
reset

bottom.side = BOTTOM
top.side = TOP
top.game = bottom.game = self

puts bottom.name+' starts...'
display

until game_over?
puts ''
if @player_to_move == TOP
move = top.choose_move
puts top.name+' choose move '+move.to_s
else
move = bottom.choose_move
puts bottom.name+' choose move '+move.to_s
end
make_move( move )
display
end

[bottom_score, top_score]
end
end

p1 = Player.new( 'Player 1' )
p2 = Player.new( 'Player 2' )
KalahMatch.new.start( p1, p2 )
------=_Part_1773_7619312.1134419167836--
 
A

Adam Shelly

------=_Part_4466_12379084.1134426269894
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
Content-Disposition: inline

Of course I introduced an error while cleaning up my code:
That will teach me to skip unit tests...

in AdamsPlayers.rb, line 111
=09=09=09i =3D best_move(b) if taketurn
should be
=09=09=09m =3D best_move(b) if taketurn

-Adam.


Here are my Kalah Players.
Click to expand...

------=_Part_4466_12379084.1134426269894
Content-Type: application/x-ruby; name=AdamsPlayers.rb
Content-Transfer-Encoding: 7bit
Content-Disposition: attachment; filename="AdamsPlayers.rb"


#Adapter class - rotates the board so that player's Kalah is always 6
class KalahPlayer < Player
def choose_move
n = (@side==KalahGame::TOP) ? 7 : 0
@board = @game.board
@board = @board.rotate n
return get_move + n
end

#simulate a move
def simulate board,i
b = board.dup
stones,b=b,0
while stones > 0
i = 0 if (i+=1) >12
b+=1
stones-=1
end
if (0..5)===i and b==1
b[6]+= (b+b[opposite(i)])
b=b[opposite(i)]=0
end
b
end
def opposite n
12-n
end

end

#Some helpers in Array
class Array
def rotate n
a =dup
n.times do a << a.shift end
a
end
def sum
inject(0){|s,e|s+=e}
end
#choose randomly between all items with given value
def random_index value
n=rand(find_all{|e|e==value}.size)
each_with_index{|e,i| return i if e==value and (n-=1)<0 }
end
end

#### Some simple players for testing:
class RemoveRightKalahPlayer < KalahPlayer
def get_move
5.downto(0) {|i| return i if @board>0 }
end
end
class RemoveHighKalahPlayer < KalahPlayer
def get_move
myboard = @board[0,6]
myboard.index(myboard.max)
end
end
class RemoveRandomHighKalahPlayer < KalahPlayer
def get_move
myboard = @board[0,6]
myboard.random_index(myboard.max)
end
end
class RemoveLowKalahPlayer < KalahPlayer
def get_move
myboard = @board[0,6].select{|e| e>0}
@board[0,6].index(myboard.min)
end
end
class RemoveRandomLowKalahPlayer < KalahPlayer
def get_move
myboard = @board[0,6].select{|e| e>0}
@board[0,6].random_index(myboard.min)
end
end

class ScoreKalahPlayer < KalahPlayer
def get_move
possible_scores = (0..5).map{|i| score_for i}
possible_scores.index(possible_scores.max)
end
def score_for i
return -1 if @board == 0
simulate(@board,i)[6]-@board[6]
end
end


### Some better players

#Tries to find the biggest increase in score for a turn
class DeepScoreKalahPlayer < KalahPlayer
def get_move
best_move(@board)
end
def best_move board
possible_scores = (0..5).map{|i| score_for(board,i)}
possible_scores.index(possible_scores.max)
end

#find the increase in score if we make move m
def score_for board,m
return -100 if board[m]<1 #flag invalid move
b, taketurn = board,true
while taketurn
taketurn = ((b[m]+m)%14 == 6) #will we land in kalah?
b = simulate b,m
m = best_move(b) if taketurn
end
b[6]-board[6] #how many points did we gain?
end

end


#Tries to find the biggest increase in score for a turn
#subtracts opponent's possible score
class APessimisticKalahPlayer < DeepScoreKalahPlayer
MaxDepth = 3
def get_move
@level=0
best_move(@board)
end
def best_move board
return super(board) if (@level > MaxDepth)
@level+=1
possible_scores = (0..5).map{|i|
score_for(board,i) - worst_case(simulate(board,i))
}
@level-=1
possible_scores.random_index(possible_scores.max)
end
#biggest score the opponent can get on this board
def worst_case board
worst = 0
opp_board = board.rotate 7
6.times {|i|
s = score_for(opp_board, i)
worst = s if worst < s
}
worst
end
end




------=_Part_4466_12379084.1134426269894--
 
A

Adam Shelly

Not strictly quiz related, but why do my emails to the list get have
certain characters garbled when they are added to the ruby-talk
archives (linked from the ruby quiz site)?

My post at http://www.ruby-talk.org/cgi-bin/scat.rb/ruby/ruby-talk/170347
has =3D09 in place of tabs and =3D3D instead of equals.

Or at least that's what I see. I'm not even sure if it's a problem
with the mail I send from gmail, or with my browser settings viewing
the archive...
Any Ideas?

Thanks,
-Adam
 
D

David Balmain

Hi Adam,
Just ran a tournament with your players. In case you or anyone else is
interested;

APessimisticKalahPlayer scored 527 points in 2265.782466 seconds
AHistoryKalahPlayer scored 478 points in 98.2062879999999 seconds
RemoveRightKalahPlayer scored 469 points in 0.004744 seconds
DeepScoreKalahPlayer scored 460 points in 0.055886 seconds
ScoreKalahPlayer scored 450 points in 0.020305 seconds
RemoveRandomLowKalahPlayer scored 312 points in 0.012781 seconds
RemoveRandomHighKalahPlayer scored 309 points in 0.013103 seconds
RemoveHighKalahPlayer scored 264 points in 0.005501 seconds
RemoveLowKalahPlayer scored 187 points in 0.007318 seconds

Cheers,
Dave
 
A

Adam Shelly

Cool.
I'm suprised RemoveRight did better than DeepScore.
I was looking more at HistoryPlayer, (which should do better than
Pessimistic, since it uses the same choice for any unknown situations)
and I realized that when scoring a move, it is giving too much weight
to the subsequent turns. So it can choose the absolute best move on
turn 2, for instance, then make a bad move 3 turns later, and end up
ranking the turn 2 choice as the worst possibility. So for now, the
history information it keeps is mostly useless, except for a speedup.=20
My history algorithm needs some tuning (if it can be salvaged at all
:)

I'd be curious to see what happens if you add the other submitted
players to the tournament. Can you post the tourney framework?

-Adam
 
S

Steve Litt

If you're looking for a definition, try Wikipedia:

http://en.wikipedia.org/wiki/Unit_testing
Click to expand...

Ahhhh, I've always called those things "test jigs". Thanks.
If you are curious about Ruby's Unit Test library, it is documented
here:

http://www.ruby-doc.org/stdlib/libdoc/test/unit/rdoc/index.html
Click to expand...

I'm gonna actually have to see some real code with the Ruby unit test. The
preceding URL makes it look harder and more cumbersome than just writing a
subroutine to exercise your new class.

Thanks

SteveT

Steve Litt
http://www.troubleshooters.com
(e-mail address removed)
 
J

James Edward Gray II

I'm gonna actually have to see some real code with the Ruby unit test.
Click to expand...

There are many examples on the Ruby Quiz site.

Rubyforge would also be an excellent place to search. I can tell you
at least two projects that have a complete test suit (because they
are mine): HighLine and FasterCSV. Download the source and take a
peak.

James Edward Gray II
 

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments. After that, you can post your question and our members will help you out.

Ask a Question

Similar Threads

[SUMMARY] Kalah (#58) 2
[QUIZ] Geometric Intersections (#233) 1
[QUIZ] Kalah (#58) 24
[QUIZ][SOLUTION] Grid Folding (#63) 3
[SOLUTION] Ruby Quiz #33 Tiling Turmoil 2
[QUIZ][SOLUTION] Grid Folding (#63) 2
anyone seen this before? (long) 1
[QUIZ] Modular Arithmetic (#179) 13

Members online

Total: 26 (members: 1, guests: 25)
Robots: 331

Forum statistics

Threads
473,755
Messages
2,569,536
Members
45,009
Latest member
GidgetGamb

Latest Threads

Top