tic-tac-toe.clj

(defn sqr [x] (* x x))

(defn winning-combinations [size-of-grid]
  (let [indices (range 1 (inc (sqr size-of-grid)))
        rows (partition size-of-grid indices)
        cols (apply map list rows)
        diagonal-1 (take-nth (inc size-of-grid) indices)
        diagonal-2 (take-nth (dec size-of-grid) 
                             (range size-of-grid (sqr size-of-grid)))]
    (map set (concat rows cols [diagonal-1 diagonal-2]))))

(def is-superset? every?)

(defn has-won? [player-moves]
  (some (partial is-superset? player-moves) (winning-combinations 3)))

tic-tac-toe.js

var contains=function(list,element) {
  return list.indexOf(element)>=0;
}

var isSubset=function(list1,list2) {
  return list2.every(function(element){
    return contains(list1,element);
  })
}

var winningCombinations=[
  [1,2,3],
  [4,5,6],
  [7,8,9],
  [1,4,7],
  [2,5,8],
  [3,6,9],
  [1,5,9],
  [3,5,7]
];

var hasWon=function(playerMoves) {
  return winningCombinations.some(function(combination){
    return isSubset(playerMoves,combination)
  });
}