Stack Exchange
Why am I getting RecursionError: maximum recursion depth exceeded?
This is the code:
def isEven (n):    #function checks if the number is even or odd

    if (int(n)%2) == 0:
        True
    else:
        False


def Edit(b,x,y): #function loops through the number
   m = str(b)
   for i in range(1, len(m)+1):
        if isEven(m[-i]):
            continue
        elif int(m[-i+(len(m))]) > 5:
            b = b + 1
        else:
            b = b - 1
        y = y + 1
        x = x + 1
   Edit(b,x,y)

number = input()
Number = int(number)
caseNum = 0
moves = 0

Edit(Number,caseNum,moves)

print('Case #' + str(caseNum) + ' : ' + str(moves))

I want to create a code that checks if there is an odd digit in a number and increments or decrements the number until there are no odd digits in the number.

You call Edit as the last thing in Edit. You will need to return somewhere to stop the recursion.

Unrelated to the recursion problem, but I suggest you try print(isEven(3)) and see if it produces the output you expect.

Your Edit function keeps calling itself. Python has a built in recursion limit that you are hitting. See https://docs.python.org/3/library/exceptions.html#RecursionError

To add to what's already said, you need to add some return before the True and False in isEven(), as a True or False alone won't do anything, you function will just return None.

I'm not really clear on what output you're expecting, so assuming that you want no odd digits in a number(4567 -> 4468)
You simply can do that by:
n = [int(i) for i in input("Enter a number: ")]
caseNum = 0

for i, x in enumerate(n):
    if x % 2 != 0:
        if x > 5:
            n[i] += 1
        else:
            n[i] -= 1
        caseNum += 1

print("".join(str(x) for x in n), "CaseNum: ", caseNum)

You don't really need an Even function if you're having if-else in main program already.
As of your code, if you're using the Even function, you need to return a the value True or False.
 def isEven (n):    #function checks if the number is even or odd
    if int(n) % 2 == 0:
        return True
    else:
        return False

You're getting the RecursionError as you're calling same function(looping it) without any stopping condition. 
 Edit(b,x,y)

This statement in your function is creating the issue and after a limit, python stops executing and gives you the error. 
If you can elaborate the use of caseNum and moves, I'd be able to add them in program.

caseNum records the number of increments or Decrements

@ladan There you go.

Thanks, this really helped

Even without an unconditional call to Edit(b,x,y) as the last step, your code was heading for "maximum recursion depth exceeded" regardless.
The problem is you're incrementing or decrementing the number based on it's digits.  Consider a number like 3000 with one high order odd digit.  You'd need to increment or decrement it nearly 1000 times over 1000 recursive calls.  But the default stack depth is only 1000 frames, so you're already sunk.
But it gets worse.  Consider a simple number like 10, your decrementing and incrementing logic will change it to 9, then back to 10, then 9, then 10, and so on.
You're better off incrementing and decrementing individual digits, as @DeepMehta does, rather than the entire number.
To properly control the recursive call to Edit(), use your x and/or y counters to determine if any changes were made during this call.  If no changes, return the number.  If there were changes, recurse to finish the job.
And as far as the isEven() function, you can simply do:
def isEven(number):
    ''' function checks if the number is even or odd '''

    return int(number) % 2 == 0

