Automated solver for 2048 First step, if you don’t have it, you need to install Groovy.Second step is to install the Google Chrome WebDriver (just unzip the appropriate file to a local directory) Next, edit the script to set the path to the Chrome Driver then execute the script: groovy solver2048.groovy After a few seconds, you should see a browser opening, and the bot trying to solve the puzzle.If it fails, it will automatically retry after 5 seconds.The script outputs some statistics, if you fancy updating the strategy !([ (""), (""), ("") ]) .setProperty("", ""); browser trials = 0 success = 0 > scores = [] gridSize = 4 squareGridSize = gridSize*gridSize () { (trials) { scores (browser.js.'') "" "}%" "})" } browser.js.exec '' trials } { T left U right ( T , U ) { .left = left .right = right } } {} { freeCells win ( , [][] ) { (score, grid) hasGoal = sum = 0; ( i=0; i {} > {} > > { ( o) { o.left (()left) } } ([] ) { len = source.length [] res = [len] idx = 0 ( i=0;i< len;i) { (source[i]0) { res[idx] = source[i]; } } start = 0 next = 0 score = (start < len) { ps = next>gridSize?0:res[next] pv = next>gridSize?0:res[next + 1] (ps pv) { res[start] = 2 * ps score += 4*ps*ps next } { res[start] = ps } next start } noChange = .equals(source, res) (noChange?:score, ([])res) } ([] , ) { [][] src = grid.right noChange = 0 score = len = src.length [][] lines = [len][] ( i = 0; i < len; i) { line = scoreAndLines[i] lineScore = line.left (lineScore) { noChange } { score += lineScore.doubleValue() } lines[i] = line.right; } result (noChangelen) { result = (, lines) } { result = (score, lines) score = .pow(score, .sqrt(1+result.freeCells)) result.left = score } result } [] ([] ) { len = arr.length [] result = [len] ( i=0; i< len;i) { result[len-i] = arr[i] } result } [][] ([][] ) { len = gridSize [][] res = [len][] ( i=0; i emptyCells = [] ( i=0; i 0) { indexAndRow = chooseRandomCell(grid) index = indexAndRow.left row = indexAndRow.right grid[index][row] = 2; score2 = *recurseEstimate(grid, depth, maxDepth) grid[index][row] = 4; score4 = *recurseEstimate(grid, depth, maxDepth) score = (score2 + score4)* } score } ([][] , , ) { leftright = leftRightScore(grid) updown = leftRightScore(transpose(grid)) left = leftright.left right = leftright.right up = updown.left down = updown.right leftScore = left.left.doubleValue() rightScore = right.left.doubleValue() upScore = up.left.doubleValue() downScore = down.left.doubleValue() score = (leftScore rightScore upScore downScore) { ; } (leftScore ) { score += childScore(left, depth, maxDepth) } (rightScore ) { score += childScore(right, depth, maxDepth) } (upScore ) { score += childScore(up, depth, maxDepth) } (downScore ) { score += childScore(down, depth, maxDepth) } score } (>> ) { [][] grid = orig [][] root = (0, grid) (root.win) { } depth = 1 + 2*(().sqrt(*(squareGridSize-root.freeCells))) leftright = leftRightScore(grid) updown = leftRightScore(transpose(grid)) leftScoreAndGrid = leftright.left rightScoreAndGrid = leftright.right upScoreAndGrid = updown.left downScoreAndGrid = updown.right (leftScoreAndGrid.left rightScoreAndGrid.left upScoreAndGrid.left downScoreAndGrid.left ) { sleep() restart() } { left = leftScoreAndGrid.left?leftScoreAndGrid.left + estimateScore(leftScoreAndGrid.right, depth, depth): right = rightScoreAndGrid.left?rightScoreAndGrid.left + estimateScore(rightScoreAndGrid.right, depth, depth): up = upScoreAndGrid.left?upScoreAndGrid.left + estimateScore(upScoreAndGrid.right, depth, depth): down = downScoreAndGrid.left?downScoreAndGrid.left + estimateScore(downScoreAndGrid.right, depth, depth): solutions = [ (left, ), (up, ), (right, ), (down, )] .shuffle(solutions) .sort(solutions) keycode = () solutions[0].right browser.js.exec keycode, } } browser = (: ()) browser.with { go "" js.exec } restart() () { sleep() (nextMove(js.''))