My abstract strategy game AI implements negascout in an iterative deepening framework, using zobrist keys and killer moves. I use bitboard representation for my board.
However, when running a version of the game on Android devices, I can only search to a depth of 4, because starting with 5 the search starts taking more time (depth of 5 takes 3-4 seconds per move).
I would like to at least go to depth 5 so I was thinking if it would make sense to store the score of previous game moves in a sort of table and then quickly access them. If the score is not found, the normal eval function kicks in.
Does this make sense, and more importantly, will it bring performance benefits?