Title says it all. Feel free to add comment, theory, or explanation.

Just to clarify, this is only regarding turn 1 of White, and no proceeding turns after it.

  • 1
    At what depth? Brute force doesn't exhaust all possibilities of chess yet, so depth is important. Commented Mar 16, 2014 at 0:50
  • That is a great point, one that I intentionally omitted for the sake of brevity/clarity. I think it is best to list at any depth, to see if a pattern emerges as to how the choice evolves, if at all.
    – Anon
    Commented Mar 16, 2014 at 0:59
  • I don't know what the current engines can do, but as opening theory is usually over 20 moves deep, that is pretty far for a chess engine. As position evaluation in the opening is different than the rest of the game and engines rely on opening books, their evaluation functions are not tuned for the opening.
    – newshutz
    Commented Mar 16, 2014 at 14:24

5 Answers 5


Houdini 1.5 on my old machine (1.8 G 2 cpu) slows down a lot around 20 ply (10 moves).

At 20 ply, it seems to slightly favor a four knights queen pawn game, starting with d4 or Nf3 over the Four Knights (1.e4 e5 2.Nf3 Nc6 3.Nc3 Nf6)

it switches at 22 ply to the Ruy Lopez Berlin (1.e4 e5 2.Nf3 Nc6 3.Bb5 Nf6 4.O-O Be7).

at ply 23, it switches back to d-pawn four knights, but starting with 1.Nf3


None - yet.

Brute Force is a pretty well defined problem solving technique that consists of checking each and every candidate for whether it is a solution. Since we are starting at move 1, a candidate has to be defined as a complete game of chess and the only possible objective criterion for its evaluation is whether it forces a win for white or not. No engine has analyzed a forced win for white from move 1 so far, so no actual brute-force engine has reached a conclusion yet.

As soon as you introduce a heuristic (or multiple ones like positional advantage, material advantage, space advantage...) for evaluating partial solutions (game positions that are not a checkmate yet) and their distance to a complete solution, like all chess engines do, it stops being a brute-force engine. Those evaluation techniques are the reason why chess engines are able to choose moves at all until the whole space of possible chess games is solved and/or a force win for white is found (which I think is highly unlikely).

Thus, my answer is that there are no brute-force engines in use today - if there were one it would still be thinking. Yes, brute-force might be used to describe the basic technique that modern heuristics developed from, but the evaluation criteria are actually a lot more important for an engine's capabilities. To put it bluntly, calling todays chess engines 'brute-force' is akin to calling a house a 'hole-thing', just because you need to dig a hole for the foundation. The rest is much more important and interesting.

I hope you, dear reader, will not take this as nit-picking on words, but as an addendum to the actual answers already given by other people. They answer the spirit of the question, this one... just the semantics - there was nothing else left to answer. :)


A chess engine works by trying to "rate" positions, and evaluate how strong they are. It could find a checkmate in 4 moves (that one where white checkmates by getting queen to f7 (IIRC)) but it'd be stupid to consider this "AHA! My evaluation is that I have won!" As such it is very subjective as it depends hugely on what it thinks the opponents best move is.

It is for this reason it is not (read: I really really doubt, with my mathsy-background) known if chess is a fair game, that is will "perfect" playing by both sides lead to a draw, or white or black to win, because that "perfect" part is so subjective.

With 0s and Xs, it is a fair game because it is easy to show that "perfect" playing leads to a draw.

  • It is for this reason it is not that it is know if chess is a fair game Pardon?
    – Anon
    Commented Mar 18, 2014 at 4:04
  • @Akiva sorry, yeah "has anyone ever been so far as to decide what not to look like" moment, I'll fix it! - Fixed!
    – Alec Teal
    Commented Mar 26, 2014 at 23:31

A very interesting article regarding this.

It gives an overview of what Houdini suggests for the first few moves for White (and also Black).

  • 1
    Please say a few words about why you find it interesting, and not just give the link. Commented May 6, 2014 at 10:40

Figured I'd post the famous Deep Blue vs Kasparov games.

Game #  White       Black       Result  Opening     Comment
1       Deep Blue   Kasparov    1–0     e4 c5
2       Kasparov    Deep Blue   1–0     Nf3 d5
3       Deep Blue   Kasparov    ½–½     e4 c5       Draw by mutual agreement
4       Kasparov    Deep Blue   ½–½     Nf3 d5      Draw by mutual agreement
5       Deep Blue   Kasparov    0–1     e4 e5       Kasparov offered a draw after the 23rd move.
6       Kasparov    Deep Blue   1–0     Nf3 d5
Result: Kasparov–Deep Blue: 4–2

Game #  White       Black       Result  Opening     Comment
1       Kasparov    Deep Blue   1–0     Nf3 d5
2       Deep Blue   Kasparov    1–0     e4 e5
3       Kasparov    Deep Blue   ½–½     d3 e5       Draw by mutual agreement
4       Deep Blue   Kasparov    ½–½     e4 c6       Draw by mutual agreement
5       Kasparov    Deep Blue   ½–½     Nf3 d5      Draw by mutual agreement
6       Deep Blue   Kasparov    1–0     e4 c6
Result: Deep Blue–Kasparov: 3½–2½

Deep Blue

e4 c5 = 1-0-1

e4 c6 = 1-0-1

e4 e5 = 1-1-0


Nf3 d5 = 3-2-0

d3 e5 = 0-1-0

  • However, it should be noted that Deep Blue was using an opening book. Commented Mar 17, 2014 at 1:01
  • Yes, and it was effectively a tailored engine specifically aimed at beating Kasparov. Interestingly enough, Kasparov challenged it to a rematch, and IBM refused, to which they then went ahead to dismantle the machine. Kasparov did not have the benefit of studying his opponent as the IBM team did.
    – Anon
    Commented Mar 17, 2014 at 1:49
  • Kasparov also played "well known anti-computer tactics" before it left the opening book he was at a disadvantage. (Source, preface of Batsford's Modern Chess Openings and wikipedia and stuff, book by Nick De Firmian)
    – Alec Teal
    Commented Mar 17, 2014 at 9:24
  • @Alec Was Kasparov not aware that there would be an opening book used? It seems to me that anyone writing such a book would have prepared for "anti-computer tactics", especially if they were well known. Commented May 6, 2014 at 14:46
  • @undergroundmonorail I'm not sure. A moment of empathy though, imagine the gamble, do I try anti-computer tactics or not? It is evident that the games are not as lovely as Kasparov's usual. EVEN in the opening. Also this is a man who has forgotten about the chess clock before, maybe he didn't research it, who knows.
    – Alec Teal
    Commented May 6, 2014 at 15:41

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.