1337 - Hindi N. John (Jr) and the Chess Game of the Covenant

[ichigo]

http://coj.uci.cu/24h/problem.xhtml?abb=1337

Does some body know how the types of movies. I have much douts, "because the information in the problem is so long (really not) "

[ymondelo20]

Well, maybe the best thing is to link a document that clearly defines which are the valid moves. I will do this later. Anyway, no one has solved the problem yet. It may be appropriate to review (for safety) data sets.

[ilv]

Indeed, it seems to be a problem only for those who know how to represent chess moves in advance. May be that's why nobody have solved it yet.

[ichigo]

Yes... but, it is not the only problem. I know the chess notation, but my code don´t work. I just get past the first test and dead on the second.
And I have a doubt: impossible plays most take in to consideration, bye example :fxa4
and if the result of games: (1-1, 1-0)...
I Think that the problem have so mush "insertidumbres" jajaja ...

[ymondelo20]

Done... see hint of the problem...
We will translate this problem to english in a few days.

[jelara]

By the way, has anybody noticed the... symbolism of the problem's ID?

[jelara]

Well, this problem was part of an internal contest (5th Xtreme Programming Championship), and amongst the contest documentation was a document containing the specification of the algebraic notation, as used in the problems. That's why none of the problems in the contest included it (as you can see, it's very large, and all of the problems were chess-related), and when we passed this problem from the Xtreme Judge's problemset to the COJ, we forgot this detail.

The problem has already been augmented with the full description in the hint, take a look at it and attempt to solve it again. And, along the path, you may learn a thing or two about algebraic notation

[ymondelo20]

New sample test has been added. Problem is now enabled.