by Sykes25 » Sat Nov 18, 2006 10:51 am
[quote:e674d4a55b="sphilipp8"]I can't figure this one out. I have Remy at 2nd and Smalley at SS. HAL brings in Bailor to PH for Remy, which is fine. But then in the field he moves Smalley to 2nd and puts Bailor in at SS. This makes no sense. I know the code must be complex but what is the logic in this?
Bailor is a 4e31 SS, Smalley a 3e24 SS.
Bailor is a 4e32 2B, Smalley a 4e41 2B.
I know a little bit about developing algorithms but I can't figure out what kind of a sensible algorithm would do this. It can't be random because it's happened a few times.
Isn't it a no-brainer to leave Bailor at 2B as Bailor is a better fielding 2B than Smalley and leave Smalley at SS as Smalley is a much better fielding SS than Bailor?
Why would HAL weaken both positions? I would love to see the code for this because I can't see how it's possible.[/quote:e674d4a55b]
Code follows a strict order of events. If A happens then go to B. You can attempt to program it so if C requires you to look at whether or not A to B took place and then proceed to D or skip to E, then you get beyond what the CD-Rom game is capable of.
Remy plays 2B. Now that he is out of the game, HAL must decide who the best remaining available player is who is eligible for 2B. Using what I think is the OPS logic, Smalley fits the equation and goes to 2B. HAL is then forced to do the same for SS and now since Smalley has just been moved and is no longer eligible to move back (or the program logic would loop), Bailor moves to SS.
It's really quite simple to understand WHY it was made. You just need to understand that it is not what you would have done and move on from there.