tfelypoc/drummyfish-s_based--data--
tfelypoc
/
drummyfish-s_based--data--
1
2
Fork 0
Code Issues Projects 1 Releases Activity

Update

This commit is contained in:
Miloslav Číž 2022-10-20 15:06:59 +02:00
parent 61e37aca12
commit b6dd3f5ede
1 changed files with 16 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
ideas.txt
View File

@ -662,3 +662,19 @@ could be possible), then sample randomly generated positions, compute
probability of hitting a reachable position and from this probability and the
number of all possible positions estimate the count.
---
System that assigns unique 2D coordinates to each chess position so that pseudo
trees of walking the game tree can be nicely drawn. Make it so that the
positions similar to each other will be closer together and states that are
likely to be later in the game will be further down from the top at which the
initial position is.
One idea: define position as a "diff" against the initial position, diff is
basically a board with one additional possible square value: delete (piece on
a square means place that piece, emptry square means leave the square as is).
Now the state's vertical position could be determined by the number of non-empty
squares in the diff so that position closer to initial position will be more on
the top. The horizontal position of the position will be determined by the
positions of the non-empty squares and their values -- we have to create a way
to translate this to a single number (horizontal coordinate), this number should
spread the states evenly across the width of the graph.
---