Not logged inRybka Chess Community Forum
Up Topic The Rybka Lounge / Computer Chess / AlphaZero beats Stockfish 8 by 64-36
1 2 3 4 5 6 7 Previous Next  
- By gsgs (***) [de] Date 2018-01-11 00:51
define the distance between 2 positions as the average number of moves
(within a simple [to be improved] quality-range  ) needed to
go from one position to the other

play n games and store all positions from these games in a database
and evaluate the positions (x,r) according to the result r of that game
and the number x of moves to reach the final position

now take any position and search for positions in the database, which are "close"
make all random moves, if the position gets closer then keep them
delete the worst members at each step, continueg

allow pseudomoves, like changing the file of a pawn , without altering the
position too much

apply a function f(x1,x70) to a fen (numbers extracted as #of empty squares)

modify

learn , improve
Up Topic The Rybka Lounge / Computer Chess / AlphaZero beats Stockfish 8 by 64-36
1 2 3 4 5 6 7 Previous Next  

Powered by mwForum 2.27.4 © 1999-2012 Markus Wichitill