-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathnotes.txt
56 lines (35 loc) · 2.03 KB
/
notes.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
THIS FILE IS FOR TAKING NOTES ABOUT THE WHOLE PROGRAM!!!!
Functions to be done:
put_value //to add a block with a certain height at position (x,y)
Ideas:
is_valid_value //to check if a given value can be put at this position.
determine_next_pos //to determine where will be the next digit to iterate
Doing :
(isma) determine_next_cell // to see which cell is the next to test
(isma) test_main //to have a fixed board where we know the outcome
Done :
(isma) view_count //to calculate the current_view matrix.
(isma) print_board //to actually output the board we have
(isma) is_solution //to see if current_view == target_view, should return 1 if it is.
(isma) update_possible_values //to remove a given value from the peers' possible values
(Jon) arg_check //to see if the command line input is valid
valid_character_and_argc_check
(Jon) find_board_size //to find the board size based on the command line input
(Jon) put_matrix //to put the command line input into target_view and set base conditions for board and current_view
(Jon)
____________________________________________________________________________________________________________________
THIS SECTION IS FOR WRITING VARIABLE AND ARRAY NAMES AND CONVENTIONS SO WE CAN ALL BE ON THE SAME PAGE
Our 3 matrices are called:
board
target_view
current_view
When accessing any of our matrices the convention is as follows:
matrix[y][x]
y is always vertical (which row you are looking at), x is always horizontal (which column you are looking at)
______________________________________________________________________________________________________________________
THINGS THAT NEED TO BE TESTED:
- Check if spaces in command line argument
- Verify if we need to check row/column validity once it's completed
- number of arguments should be N * 4
RECURSIVE FUNCTION SHOULD RETURN 1 IF IT FINDS A SOLUTION, OR O IF NOT SO WE CAN TRACK AND UPDATE WHAT WE HAVE ALREADY TRIED
WE COULD BE PASSED VIEW VALUES OF 0 (NOT KNOWN) MAYBE CHANGE CODE TO ACCEPT THESE PUZZLES?