0

I've just been playing for fun online a little bit, and was wondering how hard the computer I've been playing against is. NOTE: This was made for a javascript competition, and doesn't include castling or en passant capture.

http://js1k.com/2010-first/demo/699

1
  • It's probably quite bad. I won the two games I just played against it, and I'm not that good. But, no castling or en passant means that it's not really playing chess, so it's not like I can give you an approximate elo to compare with other chess players or engines--it's simply not the same game as normal chess. Commented Mar 29, 2014 at 4:13

3 Answers 3

2

As a programmer, trying to write a chess engine by Javascript which runs on client's browser is very interesting. It has only 1018 bytes!

The engine doesn't obey the rules thoroughly (however we can ignore at this time). On the other hand it plays immediately and doesn't consume time to find better moves. It just trying to avoid obvious and basic blunders and probably it can find mating moves.

I suspect it uses any popular approach such as min-max search trees to evaluate moves. It's a very simple program and most of newbies can defeat it easily.

So, if you're not a programmer and following for a chess engine, don't count it as a real chess program.

0

It does have the capability to spot basic mating threats as far as I saw. No opening theory book is supported, thus its opening play is terrible. It has a bad evaluation function, as it was not able to spot simple threats and does not recognize what is weak or strong move. Defending capabilities are low. I won fast so I can not comment on its endgame or attacking skill. In short, it plays as someone who just learned the game rules ( except en passant and castling, of course ).

Hopefully this helps.

Best regards.

0

I didn't play a full game with it (mainly because of having to scroll to see the full board), but I'm not so impressed. Also, there is a bug in it which prevents long castle.

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.