title: Finding a path: SAT solving
body: <p>We are given an n*m grid, which has obstacles at various points,the  starting and ending location of the bot. The task is to find a collision free path from start to end. This problem is to be modelled as a SAT problem. </p>
  
  <p>Please guide me on what should be done in this case to get an optimal solution.</p>