Anonymous wrote on Wed, Mar 30, 2011 10:42 PM UTC:
One of the major problems that I find in coding this game is calculating all possible moves for a Go Away when it is adjacent to one or both Basilisks. Obviously, a computer program can't loop through all 40320 possibilities and check each one! Does anyone have any suggestions for optimizations?
One of the major problems that I find in coding this game is calculating all possible moves for a Go Away when it is adjacent to one or both Basilisks. Obviously, a computer program can't loop through all 40320 possibilities and check each one! Does anyone have any suggestions for optimizations?