I am a 47-year-old autodidactic learner who likes to solve problems. I was fascinated by the 29 twists of the Rubik's cube that guarantee that along the memorized sequence of moves the cube would be solved even if the randomness of the cube's squares is different at every game start. At some point in the sequence of twists and turns it will be solved, whether it is move 10 or move 25, the solution will always appear.

Just like the Rubik's cube I believe chess has a discrete iteration of chess piece moves that will always generate a winning move for white given all of the parameters known (each piece on each square). I am searching for the twists and turns of different pieces produced by imagining the board and pieces as a gradient of magnitude that makes the point values more fine-grained.

For example, a knight on the corner of the board would have a much lower point value than a knight in the middle of the board. I start off by imagining the king as a value of 9 if it is alone in the center of the board. At the beginning of the game the king has a value of 1 because he is hemmed in by all of the other pieces. As the first pawn leave the kings squares the kings value becomes worth 2 because the empty square represents a move the king could make. If you can maximize the value of the pieces based on the potential moves that win pieces, moves that save pieces, moves that block pieces and moves that sacrifice pieces to give other pieces higher point values then the person with the maximum value possible who sustains or increases its value will win the game.

Will it work? I do not know. But I am going to have fun trying it.

TronsGuitar