Camunda Team Blog

CamundaCon

Solving Santa’s Sequencing Problem Using Domain Narrowing Constraint Propagation Based on DMN collect hit policies.

Written by Rob Parker, Enterprise Architect, Australia Post on , under Community category.

CamundaCon 2019 is just around the corner! Rob Parker, Enterprise Architect at Australia Post, will be presenting Innovative Problems For Elegant Solutions and he’s shared with us a sneak peak at the kind of out-of-the-box thinking his presentation will cover:

Everybody is likely familiar with Sudoku puzzles. When I solve them, I typically use little pencil marks to track which values are still feasible in unresolved cells. In other words, for each unresolved cell, I annotate it with the set of remaining possible values or its domain. As each cell is solved, the implication is propagated to its neighbouring cells by crossing off the infeasible values (domain narrowing) from each set of candidate values. This technique is effectively a form of constraint propagation with domain narrowing.