(use srfi-1)

(define (position item lst) ;why is this not in srfi-1
  (list-index (lambda (x) (equal? x item)) lst))

(define (permutation-index permuted original)
  (let loop ((sum 0)
             (perm permuted)
             (orig original)
             (radix (length permuted)))
    (if (null? perm)
        sum
        (let ((elem (car perm)))
          (loop (+ (* radix sum)
                   (position elem orig))
                (cdr perm)
                (delete elem orig)
                (- radix 1))))))

(define (anagram-index anagram)
  (let ((original (sort anagram <)))
    (permutation-index anagram original)))

(anagram-index '(1 2 3)) ;=> 0
(anagram-index '(1 3 2)) ;=> 1
(anagram-index '(2 1 3)) ;=> 2
(anagram-index '(2 3 1)) ;=> 3
(anagram-index '(3 1 2)) ;=> 4
(anagram-index '(3 2 1)) ;=> 5