  We demonstrate how by using a reinforcement learning algorithm, the deep
cross-entropy method, one can find explicit constructions and counterexamples
to several open conjectures in extremal combinatorics and graph theory. Amongst
the conjectures we refute are a question of Brualdi and Cao about maximizing
permanents of pattern avoiding matrices, and several problems related to the
adjacency and distance eigenvalues of graphs.
