|Nov-26-11|| ||Everett: Kudos to Jonny for getting out of book by move 1.|
|Nov-28-11|| ||luzhin: Any connection to chess is purely coincidental...|
|Nov-28-11|| ||whiteshark: The game Woodpusher - Jonny had a remarkable start (1. Nf3, g5). From
the beginning white was on an unknown path, < which confused him quiet
< He did not manage to put its pieces on the right place >[LOL]> and
so black obtained a very comfortable position with many chances.
In a complicated situation white threatened to lose a piece and decided to
sacrifice its queen instead.
Although the material balance was almost even, black had more chances and locking in the white bishop.
Castling to the queenside did not help much for white and a
huge wave of aggressive black moves he succumbed.
|Nov-28-11|| ||DiscoJew: A04 Borg gambit - Borg Queen Attacks variation.|
|Dec-27-11|| ||lupko: Very strange game|
|May-25-12|| ||Oceanlake: This looks like a computer game from the 70's or so.|
|May-25-12|| ||miseiler: 23. f5!
Setting up the fork three moves later
|May-25-12|| ||Abdel Irada: Woodpusher was well named. Its incompetence in meeting an irregular opening was only exceeded by its inability to play the middlegame at all.|
What's this program's rating? The square root of negative one, perchance?
In any case, what appears in its tactics looks like a bad case of horizon effect combined with too much fermented electricity.
|May-25-12|| ||sevenseaman: The games computers play!|
|May-25-12|| ||Deji: My gooodness. I Love this game. Jonny plays an unusual move 1. Now after 27 Qc4+, there follows 27...Kf2 (only move) then 28. Qh4+ which forks bishop, knight, and queen|
|May-25-12|| ||ChessYouGood: Martians|
|May-25-12|| ||LoveThatJoker: GG
|May-25-12|| ||FSR: Jonny scored +3=4-1, finishing just a point behind the winner, at the World Computer Chess Championship (2011). A quick look indicates that it played much more standard openings in its other games. Maybe its programmers had it play 1...g5 in order to take the aptly named Woodpusher, which lost all of its games, out of book.|
|May-25-12|| ||Morten: "FSR: ...in order to take the aptly named Woodpusher...out of book."|
I shudder at the thought of what book that might be.
|May-25-12|| ||offramp: One of the few computers that ARE better at kick-boxing.|
|May-25-12|| ||FSR: <Morten> Woodpusher's other games in this tournament featured much more standard openings. World Computer Chess Championship (2011)/Woodpusher (Computer) It must have had a decent opening book.|
|May-25-12|| ||HeMateMe: I guess the pun is "Borgish" because the two contestants are software programs. |
<Why Johhny Can't Think>
<The League of Redheads>
<Woody In The Woodchipper>
|May-25-12|| ||Caissanist: <Whiteshark> helpfully quotes the following program description on the main <Woodpusher> page:|
<Woodpusher is a small chess program (< 64K) of conventional design. It uses an iterative deepening alpha-beta search with PVS and aspiration window enhancements. The first version of Woodpusher was born in 1989 as part of a university project looking into null-move search techniques. True to it's origins, this new version of the program still uses the null-move throughout the search to recognize threats and to forward prune branches of the search tree. A database of attacks from and to all the squares on the board is maintained by using CHESS 4.5's bit-board implementation. These data structures are used for both generating moves and making positional evaluations. Woodpusher's position evaluation is maintained almost entirely incrementally while making and un-making moves during the search, with very little work done at the terminal nodes. The evaluation is therefore necessarily simple, but does include true measures of mobility rather than relying on piece-square evaluations.>
Not being familiar with all the jargon I can only guess, but it sounds like they are saying that the program does not analyze tactically at all ("null-move search techniques"), relying instead purely on positional evaluation.
|May-25-12|| ||GreenLantern: <Caissanist> The most informative part of the description (to me) is the phrase 'of conventional design' because almost all the jargon that follows can be used to describe modern chess engines, including null move heuristics. To over-simplify, the technique identifies moves so strong that the player to move can forfeit his turn (make a null move), and still have a strong position. This indicates an earlier sub-optimal move by one side - a move so poor the lines arising are not examined.|
All engines analyze tactically - it's the nature of chess algorithms. You cannot evaluate a position without examining the underlying tactics.
|May-25-12|| ||kevin86: The computers are playing like people used to. it looks like an 1890s game.|
|May-25-12|| ||maxi: Jonny can't read,
but Jonny can play.
|May-25-12|| ||Rob Lob Law: I love all the comments from people who call these computers weak. No one, I repeat NO ONE, leaving comments on this page is capable of beating either of these computers. Not now and not ever. Chess players are the most arrogant people on earth by far.|
|May-25-12|| ||MORPHYEUS: <Rob Lob Law: I love all the comments from people who call these computers weak. No one, I repeat NO ONE, leaving comments on this page is capable of beating either of these computers. Not now and not ever. Chess players are the most arrogant people on earth by far.>|
LOL. They only call them weak in comparison with the stronger engines such as Rybka, Houdini, etc.
|May-25-12|| ||numbersguy70: Trolling on a Friday afternoon?|
|May-26-12|| ||Abdel Irada: <HeMateMe>: The pun is "Borgish" because the defense black is using is called the Borg (the Grob in reverse). (In this case, against 1. ♘f3, it has a different specific name, but 1. ...g5 in general is called the Borg.)|