Question

[tpoppins]

Rotlevi--Rubinstein, Lodz 1907

[MikeB]

http://rebel13.nl/pgn4web/guess.html

If you only have the information of the moves played in the above link is there an easy way (tool) to find the players?

His Ed, I take it from your other posts that you do are not actually looking for this functionally?

It is also easy to do to using pgn-extract.

First just make sure you have no dupes in your database, add the game in question and then run pgn extract with the following flags:

Code: Select all

pgn-extract --fuzzydepth "move#" ( of last move played in game) " -U -ddupes.pgn games.pgn.  

The above example would suppress the output of unique games and extract the games considered to be duplicate at their final position at the end of "move #" in dupes.pgn

[tpoppins]

The examples so far have been too easy. Here's one that's a lot tougher:



Hardcore Tal fans should know this one immediately.

[Rebel]

Rotlevi--Rubinstein, Lodz 1907

Excellent!

Did you know this by visual recognition or did you need to consult the internet?

[Rebel]

The idea of this thread is to investigate if it makes sense to create a fun competition called know your classics. In a nutshell, each week 10 immortal (exceptional, memorable) games where you must guess the players and then contribute them via an entry form. Each good guess is rewarded with 1 point. Each week a ranking is displayed, the weekly winner. We let it run for (say) 10 weeks to find the overall winner.

Of course all these online (and offline) databases makes it easy to find these games and so I am looking for a setup to avoid that or at least makes it hard and I think the last setup (repeating the game) looks as an acceptable compromise.

[Ovyron]

You can just forbid people for looking up things online, or using software, and rely on the honor system (which works surprisingly good for such games.) It's the same concept of online chess where people are expected to not use chess engines to help them.