An Efficient Implementation for WalkSAT

TL;DR

This paper introduces a highly efficient implementation of the WalkSAT algorithm, significantly speeding up its performance by reducing redundant calculations, and surpassing previous versions and variants.

Contribution

A novel implementation of WalkSAT that decreases redundant calculations, leading to faster performance and improved efficiency over existing versions.

Findings

Speedup over previous WalkSAT implementations

Outperforms latest variants in efficiency

Reduces computational redundancy

Abstract

Stochastic local search (SLS) algorithms have exhibited great effectiveness in finding models of random instances of the Boolean satisfiability problem (SAT). As one of the most widely known and used SLS algorithm, WalkSAT plays a key role in the evolutions of SLS for SAT, and also hold state-of-the-art performance on random instances. This work proposes a novel implementation for WalkSAT which decreases the redundant calculations leading to a dramatically speeding up, thus dominates the latest version of WalkSAT including its advanced variants.