🚀 go-pugleaf

I have discovered new theorems to the VonNeumann Mini-Max theorem. The
Archimedes Plutonium Mini-Max theorem (I have not yet proved it so it
is a Conjecture still) says that each position of a VonNeumann mini-max
game has a unique OS and that all of these sub OSes converge on the OS
of the original game. When considering this new theorem then chess is a
draw for the OS of chess because the game where no pawns exist is a
draw, and other subpositions of equal material pieces.

  What I am looking for is the most perfect , the smoothest draws
played by the grandmasters of chess. The OS of chess is a perfectly
smooth long game that ends in a draw. In the OS of chess it is a dance
to try to gain the *minimal winning quotient*. The minimal winning
quotient is a pawn opposition win. See Capablanca on the King
Opposition where a pawn queens first. Thus, the OS of chess is a dance
of major and minor pieces to gain at least the Opposition pawn win in
the end game. And the major and minor pieces have to be traded down, if
retreat then you lose position which translates into a pawn Opposition
to opponent. Chess played the OS is a long dance of exchanging major
and minor pieces and then pawns and finally a draw.

   I strongly believe that the backbone of the OS of chess has already
been played many times. 

   What I ask of any reader is to please post long, smooth draw games
of chess played by grandmasters. It is these drawn games that I intend
to find the backbone of the OS of chess.

   Anyone interested in more details of my above can find it on the
bottom of this website

     http://www.newphys.se/elektromagnum/physics/LudwigPlutonium/


--- quoting in parts SCIENCE NEWS 30MAR96, pages 200-201   ** with my
comments on the below in >> ---
   The Soul of a Chess Machine: Lessons learned from a contest pitting
man against computer   By Ivars Peterson

Of course, it was downhill from there: a loss, two draws..
>> could someone please provide me with these two draws, please post to this 
>>thread, thanks in advance

Deep Blue's performance in its six-game match in February against world
chess champion Garry Kasparov impressed everyone (SN 2/24/96, p 119)..

>> I am looking for the longest draw games, smooth draw games of chess by 
>>grandmasters for it is in the draw games that are the backbone of the Optimal >>Strategy. I am sure that the OS backbone has been played many times. Would 
>>someone please post the longest, smoothest draw games of chess.

... Chung-Jen Tan of the IBM

It stores values representing the strengths of chess pieces in various
arrangements, as well as billions of sequences of moves for ending
games when only a few pieces remain on the board.

>> According to the new AP Mini-Max Conjecture the endgames are well known in 
>>chess,eg, how to win with a rook ,or, a knight and bishop in combination. So, 
>>armed with this new conjecture, the computer chess programs of the future will >>have the draw positions as the backbone of the program and strays from the 
>>draw will defeat the strayer, if the stray is quantifiably larger than the 
>>minimal win of chess which is the king Opposition of a pawn queening.


... and another database providing billions  of scenarios on how to end
a game when only five pieces remain on the chessboard, in addition to
its chip-based endgame data.

Like most chess computers, Deep Blue's strength is in looking ahead.
For any arrangement of pieces, it considers all possible moves. Then it
evaluates every response its opponent might make to each of those
moves, and so on.
  In a game of 40 moves, the number of different board positions that
can develop is at least 10^120

>> I believe Ivars Peterson is incorrect here. I am guessing that Ivars just 
>>looked up some writings by Littlewood in his book Miscellany.
>>  IF the total number possible games of chess is this number
>>
>>    301713997230054847933486967990950152652695930240
>>
>> which is considerably smaller of a number than is 10^120, then I consider  
>>Ivars remark as totally wrong.

  According to this method, instead of checking every possible chain of
moves, the computer looks down only the lines of play that seem, from
the first few possible moves, most promising. Its evaluation takes into
account the fact that neither player can see to the end of a game and
that neither performs perfectly.

>> Noone as far as I know is looking for the OS of chess. I believe I have 
>>discovered it by means of this new AP Mini Max Conjecture. And armed with this >>new method it is safe to say I can look completely through the game of chess, >>from beginning to end. And I will state again what the OS of chess is: it is a >>draw and
it is a long smooth game of trading down pieces where the minimum win
>>is the king Opposition win of a pawn queening.

..and has access to a database of essentially all the games ever played
by top chess players.

>> I please need posted all the smooth long draw games of chess played by 
>>grandmasters

  "It finds the chess position it considers most similar to its own
position and tries to reason by analogy,"...

  "That's an interesting strategy: Just keep improving the quality of
your position and don't do anything until you can see [the game]
completely to the end,"..

>> If all works out to my new Conjecture and proved true as a math theorem, then >>the computer programs of chess will either defeat of tie all games played with >>any human because their program is the OS of chess. The worst you can do 
>>playing the OS is tie. The computers will have this long smooth draw game as 
>>its backbone and any straying from this draw that is quantifiably greater than >>a Opposition pawn queening will be a win for the computer. This is the future >>computer programs of chess.
--- end quoting in parts SCIENCE NEWS 30MAR96, pages 200-201 ---