rem: left = this.stacks[left].firstChild; 
add: left = this.piles[left].firstChild; 
context:   canMoveTo: function(card, pile) {    if(pile.hasChildNodes()) return false;    var i = pile.pileNumber;    // if pile to right contains consecutive card of same suit    // or if card to right is any ace if this is a queen (note: this is a relaxation of the PySol rules)    var right = this.stacks[(i+1) % 54].firstChild;    if(right) {      if(right.isSameSuit(card) && right.isConsecutiveTo(card)) return true;      if(card.isQueen && right.isAce) return true;    }    // if card is consecutive and same suit as card to the left    // or if this is an ace and the card to the left any queen    var left = (i==0) ? 53 : i-1; // -1%n==-1 in javascript    left = this.stacks[left].firstChild;    if(left) {      if(card.isSameSuit(left) && card.isConsecutiveTo(left)) return true;      if(card.isAce && left.isQueen) return true;    }    return false;  },
meta: 3385	/local1/tlutelli/issta_data/temp/all_js/javascript/2006_temp/2006/3385/15f3df693ddf02fb9ee6a2662189220868368b23/maze.js/clean/maze.js