Draw a single closed loop passing through adjacent squares,moving only horizontally or vertically.The loop cannot visit a square more than once.At every white circle, the loop must go straight through,and it must turn on either or both of the squares visited right before and right after the white circle. At every black circle,the loop must turn, and go straight through both of the two squares visited right before and right after.
A valid entry should have a unique solution which will be forced to visit all 100 cells of the grid. The entry which uses the least number of circles,will be the winner.If there is a tie, the earliest submission will be considered. Entries shall be recieved on anuragthefirst@gmail.com , until the 10th of July.