recusrion python 33, programming homework help

in /by

recusrion python 33, programming homework help

i want a recursive function that takes in a grid (a 2d list) of  X’s and an f or two like for example:

X X X X X X X X X X X

F X X X X X X X X X X

X X X X X X X X X X X

X X H X X X X X X X X

X X X X X X X X X X X

X X X X X X X X X X X

X X X X X X X X X X X

X X X X X X X X X X X

X X X X X X X X X X X 

the H is stands for house. the recursive function should check the neighboring locations close around F (north, south, east, and west) and then the function should change the X’s that neighbor the F to F’s and change the old F to D like this:

  F  X  X  X  X  X  X  X  X  X  X

  D  F  X  X  X  X  X  X  X  X  X

  F  X  X  X  X  X  X  X  X  X  X

  X  X  H  X  X  X  X  X  X  X  X

  X  X  X  X  X  X  X  X  X  X  X

  X  X  X  X  X  X  X  X  X  X  X

  X  X  X  X  X  X  X  X  X  X  X

  X  X  X  X  X  X  X  X  X  X  X

  X  X  X  X  X  X  X  X  X  X  X

F’s can only move one space at  a time and i should be able to control howmany times it runs but that doesnt nessarly need to be in the function itself

use example file as guide

"You need a similar assignment done from scratch? Our qualified writers will help you with a guaranteed AI-free & plagiarism-free A+ quality paper, Confidentiality, Timely delivery & Livechat/phone Support.


Discount Code: CIPD30



Click ORDER NOW..

order custom paper