Free chess is a generalized form of classic chess. If we mathematically imagine that the formula of classic chess is 2х2=4, then Fisher’s formula will be 3х3=9, and this of free chess  axb=c.
    In free chess the probability of moves is by more than in classic and Fisher’s chess, that qualitatively increases its competitiveness in the struggle against computer.
    Tournaments held in Georgia in free chess showed that from 250 completed games, there are not even two similar positions. Only 7% of games were finished in a draw.
    Installing chess pieces on chessboard is the most difficult process, it needs a serious analysis and force concentration.
    Many high-power computers can count within three minutes all variants of 6,5 further moves on chessboard  that need 400 billion operations.  In case of ,,free chess“ the guaranteed count of 6,5 moves, when chess pieces are not placed on chess board instead of 4х10¹¹ within the same 180 seconds it should fulfill operations.  What does it mean this astronomical difference between these probabilities? Does it mean that modern computers can’t play free chess at high level?
     The goal of ,,free chess“ is unambiguous – the computer should not obtain a guaranteed advantage in the struggle against a chess player. Free chess can solve this problem until the mankind   solves the problem of creation of the artificial brain.
    Free chess preserves all dignities of chess, especially important is that it still remains a game stating the veracity foreseeing identical conditions for an adversary.

    Any kind of chess existing until today is a specific case of free chess.