Using two dimensional data.
Write a python function called find_words that finds and prints the list of valid words in a two-dimensional word puzzle.
The input arguments for this function are:
input_puzzle # XXXXX string of characters with NxN characters
valid_words_list: # XXXXX list of valid words separated by white spaces.
The function, find_words, should print the formatted original puzzle, the list of the valid words, and the formatted solved two-dimensional puzzle in capital letters (by removing all the unused characters). You should also write a main program that reads two files: input_puzzle.txt # XXXXX file contains the input puzzle as a string of characters.
valid_words.txt # XXXXX file contains a string of valid words (separated by spaces) See example below.
If the file input_puzzle.txt contains:
and the file valid_words.txt contains:
dog cat bird hello rat
then your main program should read the two input files and call the function find_words .
The function should then print the following formatted output:
| c | h | z |
| r | a | t |
| y | t | t |
Valid words in the puzzle are:
| C | | |
| R | A | T |
| | | T |
Notes: The original puzzle should be printed as a properly formatted N rows by N columns table and it should be printed in lower case. There should be one space before and after each character.
The input_puzzle.txt file will contain N times N lower case characters. For example if the input_puzzle.txt file contains 49 characters then the puzzle will have 7 rows and 7 columns.
Only those words that exist in the valid_words.txt file are considered valid. For example the word "hat" exist in the original puzzle but since "hat" is not in the list of valid words then it is not included in the solution.
Valid words may be listed horizontally (only left to right), vertically (only top to bottom), diagonally (left to right/top to bottom ; or left to right/bottom to top) in the original puzzle.
The two-dimensional puzzle solution should be printed with all capital letters and all the unused letters should be removed (as shown above).
It must be Python 2.7.
It would be great if this can be done before 12pm Central time.
Also, if anyone can keep it as simple as possible so that I, as a beginner programmer, can look over and learn from it, that would be excellent
There we go. Is it possible to do this within an hour and 30 minutes? The deadline has been extended and I would greatly appreciate your help.
Oh wow, thank you! This helps a lot.
Complete satisfaction here!