In multiplayer games, where many players take part in a game while communicating through a network, the players may have an inconsistent view of the game world because of the communication delays across the network. Consistency maintenance algorithms must be used to have a uniform view of the game world. The majority of these algorithms are used for wired network and they use a fixed approach which is hardly adaptable to the changing network and game environment. In these algorithms, an approach called locallag is used which delays the presentation of updates so as to account for network latencies. The value of local lag is usually fixed for a game session. In wireless networks where the network latencies can varies greatly, fixed local-lag approach can cause inconsistencies in the game state between different replicas. Also dead-reckoning is used along with local-lag to hide network latency and improve responsiveness. Keeping a fixed dead-reckoning approach in the face of changing network and game environment can produce unpredictable game behaviour which can cause human players to quit the game. In this paper, we present a dynamic and adaptable approach for local-lag and dead-reckoning in which the algorithm's parameters are changed according to the changing and unpredictable network and game environment. We believe that this adaptable approach can greatly improve consistency and hence the playability of the game