GitHub - AvivBk/Knight-Tour: wrote in C, this project is a solution to the problem of retiree steps on a chessboard - how can a kinght fill the entire board with kinght steps without going over a square twice. In addition, it performs encryption and decoding of the result by compressing bits

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
Decode_Moves.c		Decode_Moves.c
Encode_Moves.c		Encode_Moves.c
Find_Max_Path.c		Find_Max_Path.c
Knight_Tour.h		Knight_Tour.h
Path_Tree.c		Path_Tree.c
Possible_Moves.c		Possible_Moves.c
Project4.vcxproj.filters		Project4.vcxproj.filters
moves_List_Board.c		moves_List_Board.c
structure_and_defines.h		structure_and_defines.h

About

wrote in C, this project is a solution to the problem of retiree steps on a chessboard - how can a kinght fill the entire board with kinght steps without going over a square twice. In addition, it performs encryption and decoding of the result by compressing bits

c encoding list decoding recursion