From b6dd3f5ede9fd0361ba036edf7d1ab16738aeb0e Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Miloslav=20=C4=8C=C3=AD=C5=BE?= Date: Thu, 20 Oct 2022 15:06:59 +0200 Subject: [PATCH] Update --- ideas.txt | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) diff --git a/ideas.txt b/ideas.txt index 75abfeb..6323b04 100644 --- a/ideas.txt +++ b/ideas.txt @@ -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. +---