cdunn2001 / icfp11 Goto Github PK

All cards are now implemented in Python, but the 4 variations that occur during auto-application are not coded yet (nor is auto-application itself). This step should be invoked at the start of every player's turn, to that player's dead slots.

We originally thought of these as separate cards, but they're not quite that complicated because they can only ever apply during auto-application, they can only be used in dead slots, and they can only have the Identity function as an argument. Further, it looks like "inc" essentially becomes "dec" and vice-versa.

In order to run exploratory trials (for alpha-beta pruning, or some other optimizations) we need to copy state. We cannot copy closures in Python, nor in Lua. (Maybe in scheme?)

Instead, we can implement deep-copy for functor trees. That would be directly translatable to C++ as well, if we need the speed-up later.

This is hard to use here because some cards take n as an argument, which can be up to 65535. We really need to think in terms of a series of turns as a single move. We need to design what the moves are.