Solutions for 4Clojure problem 106 - http://www.4clojure.com/problem/106

106.clj

;;;;;;;;;;;;;;;;;;;
;; CLOJURE CODE: ;;
;;;;;;;;;;;;;;;;;;;

(defn transform [x]
  (if (even? x) [(+ x 2) (* x 2) (/ x 2)]
                [(+ x 2) (* x 2)]))

(defn find-path
  ([number goal] 
    (find-path 1 [number] goal))
  ([step branches goal]
    (if (not-any? #(= % goal) branches)
      (find-path (inc step) (flatten (map transform branches)) goal)
      step)))

(println (find-path 3 347))

106.py

################
# PYTHON CODE: #
################

goal = 347
start = 3
steps = 1
branches = [start]

while not goal in branches:
	steps += 1
	newBranches = []
	for branch in branches:
		newBranches.append(branch+2)
		newBranches.append(branch*2)
		if branch % 2 == 0: 
			newBranches.append(branch/2)
	branches = newBranches

print steps