Intermediate Python Coding Assignment
Budget: $30 – $250 AUD
I'm seeking an experienced Python developer to complete an intermediate level coding assignment. While I'm not certain of the exact libraries or frameworks required, I am open to recommendations based on the project scope and requirements. Strong knowledge in core Python is a must, preferably with experience in various Python libraries or frameworks. If you're comfortable with either Django, Flask, or Pandas, that's a bonus. Please provide examples of your prior work when bidding.In this assignment, we will investigate and implement six search algorithms from class: DFS, BFS, IDS, UCS, Greedy Search and A* Search. We will be applying these algorithms to decode secret messages and, in the process, we will learn about their strengths and weaknesses . In the end, we will aim to decode the large secret message in the assignment introduction!
The 6 tasks of this assignment are designed to incrementally guide us through the problem. In Task 1, we will explore how the secret messages are made. In Tasks 2-3, we will then discuss how decryption can be viewed as a search problem, and we will set up some important tools for later (i.e. a child generator and a goal test). Task 4 will involve implementing our uninformed strategies (DFS, BFS, IDS and UCS respectively). After this, we will be ready to move on to informed strategies! In Task 5, we will begin by setting up an interesting heuristic based on letter frequencies. We will then use this heuristic in Task 6 to implement Greedy and A* Search.
The 6 tasks of this assignment are designed to incrementally guide us through the problem. In Task 1, we will explore how the secret messages are made. In Tasks 2-3, we will then discuss how decryption can be viewed as a search problem, and we will set up some important tools for later (i.e. a child generator and a goal test). Task 4 will involve implementing our uninformed strategies (DFS, BFS, IDS and UCS respectively). After this, we will be ready to move on to informed strategies! In Task 5, we will begin by setting up an interesting heuristic based on letter frequencies. We will then use this heuristic in Task 6 to implement Greedy and A* Search.