A recent 3-XORSAT challenge required to minimize a very complex and rough energy function, typical of glassy models with a random first order transition and a golf course like energy landscape. We present the ideas beyond the quasi-greedy algorithm and its very efficient implementation on GPUs that are allowing us to rank first in such a competition. We suggest a better protocol to compare algorithmic performances and we also provide analytical predictions about the exponential growth of the times to find the solution in terms of free-energy barriers.

翻译：最近一项3-XORSAT挑战要求尽量减少非常复杂和粗糙的能源功能,典型的玻璃模型是随机的第一顺序转换和像能源景观这样的高尔夫球场。我们介绍了准基因算法之外的想法,以及它非常高效地应用于允许我们在这种竞争中排位居第一的GPU。我们建议了一个更好的协议来比较算法的性能,我们还提供了对时代指数增长的分析预测,以找到自由能源壁垒的解决办法。