Joined: 7/28/2005
Posts: 13
Location: UNCA, North Carolina, US
http://dehacked.2y.net/microstorage.php/info/1393/foone-chessmaster.fcm
26s, 1551 frames.
Made this cause I saw adelikat had it on his wishlist.
I made it by playing Chessmaster against GNU Chess 5. Since my PC is a little under two gigahertz and the NES is a little under two megahertz, my PC won very quickly.
I did it frame-by-frame so I could pick up the pieces as quickly as possible (Picking up pieces takes FOREVER in chessmaster), and I'm pretty sure that part is optimal. I'm not sure I got the quickest-to-checkmate moves, though.
I noticed when doing my second attempt that there is some randomness in the moves that can be manipulated.
If I go and do another run, that'd be the thing to check. (Not sure if I'm going to bother with doing another run)
Any comments, ideas?
force the nes to play a very famous mate, making it lose despite its maximum difficulty setting ? like the shepherd mate ? or a legendary game, such as Bobby Fisher...
I never sleep, 'cause sleep is the cousin of death - NAS
I did this a year and half ago:
http://acmlm.cjb.net:2/emu/nes/fceu/fcs/Chessmaster,%20The%20%28U%29.fcm
18.95 seconds (1137 frames) would be the time to beat.
I won in 8 turns and manipulated luck a bit, but there might still be a faster way ...
That's at the lowest difficulty (default) too, but the waiting times for CPU turns would be too long otherwise ... Remaking a "legendary game" would only work in 2 player mode and wouldn't be much more than a replay that could easily be done on console.
I was more thinking of manipulating the AI to actually play some famous game... if it's just to watch a game on 2p, that would be much easier to go on a chess site and watch those replays. nothing impressive in that...
I never sleep, 'cause sleep is the cousin of death - NAS
Emulator Coder, Site Developer, Site Owner, Expert player
(3570)
Joined: 11/3/2004
Posts: 4754
Location: Tennessee
The problem with a TAS defeating the CPU is also the fact that it can be done on a console. What is the significance of watching the run vs. posting the move sequence?
some luck manipulation that could only be obtained on a TAS, not a real console perhaps ? since there is some randomness...
am I repeating myself ? 0.o;;
I never sleep, 'cause sleep is the cousin of death - NAS
I'm sure it could be done in 30 seconds on console, if you try to redo the same moves I did and get lucky with the CPU (same random choices) ... but that's really only because the odds to get everything to work aren't that low for such a short game. I won in 8 turns (CPU got 7) and some of them weren't random, so it could be done within a few dozen tries at most (just not as fast).
(edited: this was before seeing the above post, looks like it's even easier)
For comparison, to reproduce my 30 second Monopoly run on console (same cards and rolls), the odds would be about 1 out of a few trillion (10 579 162 152 960, divided by the few slight variations that could work) ... low enough to be considered impossible, unless everyone in the world decides to try it at the same time for a few days nonstop ...
Sure, but I don't think the CPU's opening book allows that sequence.
1. f3/f4 e5/e6 2. g4 Qh4#
Of course, Black's second move in my movie was weird. I think what happened was White's Queen move forced the CPU to leave the opening book, and its stupidity led to that move.
Edit:
When I calculated it, I came up with 313 456 656 384. Am I missing something, or was this the strategy you used?
Cards 1/256
# H: 1+1 - Community Chest, gain $200 from "Bank error in your favor" 1/36
# H: 3+5 - Visit jail 1/9
# C: 2+4 - Buy Oriental 1/9
# H: 3+3 - Buy St. James 1/36
# H: 1+1 - Buy Tennessee 1/36
# H: 1+3 - Chance, go back 3 spaces, buy New York 1/18
# H: Build 11 houses starting from St. James
# (movie end)
# C: 5+5 - Pay $750 at St. James 1/36
# C: 1+2 - Pay $800 at New York (bankrupt) 1/18
256*36*9*9*36*36*18*36*18=256*36^4*18^2*9^2
Edit: Corrected a math mistake.
You missed a 36 somewhere, but I wasn't quite right either ...
Cards: 16*16 (I counted 16*15 earlier, then remembered they're not on the same set)
Going first: 2 (I forgot about this too)
1+1: 36
3+5: 9
2+4: 9
3+3: 36
1+1: 36
1+3: 18
5+5: 36
1+2: 18
16*16*2*36*9*9*36*36*18*36*18 = 22 568 879 259 648
Right, but good luck getting the CPU to do the 2 required (bad) moves ... but I'm surprised that 3 turn one worked, the CPU did pretty much suicide there.
This is what I posted on Snes chessmaster topic I think it applies for this game too.
Aslo, I see that lowest difficulty is used in this case. = Damn that sucks.
If you want really want to impress people, try to beat the best computer chess engine and do a 2 player run that shows it. Also, you must tell us what engine you use so we can confirm it is really true. Then it will be worth publishing a chessmaster movie. Otherwise, I consider it is NO.
Emulator Coder, Site Developer, Site Owner, Expert player
(3570)
Joined: 11/3/2004
Posts: 4754
Location: Tennessee
I totally agree with most everything Phil just said. Simply beating the bad AI isn't enough to be interesting.
I liked the battle chess idea where you abuse the take back feature to move twice. That is certainly something you won't see in normal chess play (pro chess anyway). Unfortunately the CPU takes to long to move, it is just 20 minutes of waiting for the cpu to move.
If we run Battle Chess only to show glitches, there is no need to play on hardest difficulty. Also, the glitches have nothing to do with a TAS. No luck-manipulation, none whatsoever.
At least Chessmaster on the easiest difficulty has luck-manipulation (far too little of it, though). Besides, 1. e4 e5 2. Qh5 Ke7 3. Qxe5# doesn't do the game justice, even if it is a surprising move sequence.