title: Depth First Search and Breadth First Search Understanding
body: <p>I'm making Tetris as a fun side project (not homework) and would like to implement AI so the computer can play itself. The way I've heard to do it is use BFS to search through for available places, then create an aggregate score of the most sensible drop location...</p>
  
  <p>But I'm having trouble understanding the BFS and DFS algorithms. The way I learn best is by drawing it out... are my drawings correct?</p>
  
  <p><img src="https://i.stack.imgur.com/RZ8C6.jpg" alt="enter image description here"></p>
  
  <hr>
  
  <p><img src="https://i.stack.imgur.com/Lru3o.jpg" alt="enter image description here"></p>
  
  <p>Thanks!</p>