rem: for(var i = 0; i < 4; i++) { var stack = this.stacks[i]; 
add: for(i = 0; i < 4; i++) { stack = this.stacks[i]; 
context: Canfield.findBestMoveForCard = function(card) {  // find moves to non empty stacks  for(var i = 0; i < 4; i++) {    var stack = this.stacks[i];    if(stack==card.parentNode) continue; // unnecessary??    if(stack.hasChildNodes() && this.canMoveToPile(card,stack)) return stack;  }  // find moves to empty stacks  for(var i = 0; i < 4; i++) {    var stack = this.stacks[i];    if(stack==card.parentNode) continue;    if(!stack.hasChildNodes() && this.canMoveToPile(card,stack)) return stack;  }  // find moves to foundations  for(var i = 0; i < 4; i++) {    var stack = this.foundations[i];    if(stack==card.parentNode) continue;    if(this.canMoveToFoundation(card,stack)) return stack;  }  return null;};
meta: 3385	/local1/tlutelli/issta_data/temp/all_js/javascript/2006_temp/2006/3385/18726c46ae066c60dc1639ccdfb7e83076143c1f/canfield.js/buggy/canfield.js