user3661: If we suppose to have 2 powerful computer, that are able to calculate all moves in some seconds, who will win, the black or the white? Or the game will always be draw? (let say we have a unlimited number of moves in this case)
Does the winner in this case depend from the strategy?
We now chess game is very complex having 8x8 board with 32 peices. 

user1201: The answer to "who wins between two perfect computers" depends on whether White or Black wins (or draws) with perfect play from both sides.
No one knows the answer to this question. If we did, Chess would be considered to be solved. That is, we would be able to define "perfect play". However, Chess is not generally considered likely to be solved anytime soon: the number of possible positions is simply far too great to even represent on any current machinery. If you could somehow store the correct move for any given position in a single bit (which you can't), you'd still need (approximately)...
1,250,000,000,000,000,000,000,000,000

...PETABYTES of storage space just to hold the tablebase. Obviously, this is so far beyond our current technical capabilities that it is, for the moment, impossible.
See here for more (with further links to a small fraction of the huge amount of research that exists on the topic).

3661: <p>If we suppose to have 2 powerful computer, that are able to calculate all moves in some seconds, who will win, the black or the white? Or the game will always be draw? (let say we have a unlimited number of moves in this case)
Does the winner in this case depend from the strategy?
We now chess game is very complex having 8x8 board with 32 peices. </p>
 1201: <p>The answer to "who wins between two perfect computers" depends on whether White or Black wins (or draws) with perfect play from both sides.</p>

<p><a href="https://chess.stackexchange.com/q/2778/1201">No one knows the answer to this question.</a> If we did, Chess would be considered to be <a href="http://en.wikipedia.org/wiki/Solved_game" rel="nofollow noreferrer">solved</a>. That is, we would be able to define "perfect play". However, Chess is not generally considered likely to be solved anytime soon: the number of possible positions is simply far too great to even represent on any current machinery. If you could somehow store the correct move for any given position in a <em>single bit</em> (which you can't), you'd still need (approximately)...</p>

<pre><code>1,250,000,000,000,000,000,000,000,000
</code></pre>

<p>...<strong>PETABYTES</strong> of storage space just to hold the tablebase. Obviously, this is so far beyond our current technical capabilities that it is, for the moment, impossible.</p>

<p><a href="http://en.wikipedia.org/wiki/Solving_chess#Predictions_on_when.2Fif_chess_will_be_solved" rel="nofollow noreferrer">See here for more</a> (with further links to a small fraction of the huge amount of research that exists on the topic).</p>
