Backtracking dynamics for a Hopfield-style network

Summary form only given, as follows. An energy-ascent dynamics has been defined for the Hopfield-style network with properties complementary to the energy-descent dynamics. The Hopfield-style network energy descent/ascent dynamics was extended with a backtracking algorithm that visits a stable state and then backtracks from it to visit other stable states also reachable from the same initial state via energy descent/ascent. This algorithm was applied to information retrieval to retrieve all answers (network stable states) to one question (initial state). It was also shown how it can be used to solve binary constraint satisfaction problems. Experiments on using it to solve the N-queens problem were carried out