Skip to main content
. Author manuscript; available in PMC: 2017 Jan 3.
Published in final edited form as: Proc ACM Int Conf Ubiquitous Comput. 2016 Sep;2016:706–717. doi: 10.1145/2971648.2971753

Algorithm 3.

AssignCandidate

Require: pre(․, ․), i, k
1: if i > 0 then
2:   Assign ck in ith hole
3:   call AssignCandidate(pre, i − 1, pre(i, k))
4: end if