Hi everyone,
I have read that it is possible to numerically solve a sudoku game using factor graphs and the loopy belief propagation algorithm (the sum product version of it). I understood the representation of variable nodes and factor nodes in the factor graph, however I'm still wondering about what is the energy to be minimised in the loopy belief propagation algorithm. What are the unary potentials and the high order potentials ?
