A repeated-update problem in the DeltaBlue algorithm

Tetsuya Suzuki, Takehiro Tokuda

Research output: Contribution to journalArticlepeer-review

Abstract

We observe a repeated-update problem in the process of updating walkabout strengths of the DeltaBlue algorithm, which is known as a fast constraint solving method based on local propagation. According to the basic references on the DeltaBlue algorithm, the time complexity of the planning phase is described as O(MN) for a constraint problem such that the number of constraints is N and the maximum number of methods a constraint has is M. We, however, point out that the time complexity is not O(MN) using a very simple example. In this example, the time complexity is exponential order for N. Then we present a corrected DeltaBlue algorithm whose time complexity is O(EN2) for a constraint problem such that the number of constraints is N and the maximum number of variables a constraint has is E. Finally we measure the performance of the corrected DeltaBlue algorithm using two benchmarks.

Original languageEnglish
Pages (from-to)331-341
Number of pages11
JournalConstraints
Volume3
Issue number4
DOIs
Publication statusPublished - 1998 Oct 1
Externally publishedYes

Keywords

  • Constraint solving algorithm
  • DeltaBlue algorithm
  • Local propagation

ASJC Scopus subject areas

  • Software
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'A repeated-update problem in the DeltaBlue algorithm'. Together they form a unique fingerprint.

Cite this