Maps decorated by the Ising model are a remarkable instance of a model of non-uniform maps with very nice enumerative properties. In this talk, I will first explain how one can obtain a differential equation for the generating function of Ising-decorated cubic maps in arbitrary genus, related to the Kadomtsev--Petviashvili (KP) hierarchy. In particular, this leads to an efficient algorithm to enumerate Ising cubic maps in high genus. I will also present and compare implementations of this algorithm in Maple and SageMath. This is based on a joint work with Mireille Bousquet-Mélou and Baptiste Louf.[-]