Skip to content

My implementation of the 42madrid piscine final project.

Notifications You must be signed in to change notification settings

MGuardia10/42piscine_bsq

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

42piscine_bsq

42 Piscine final project. BSQ aims to find the largest possible square within a map with obstacles and empty spaces.

C Makefile

You can see the subject HERE.

Preview

d710717e-f2d9-4111-a0ab-c3e10813b422

Installing and running the project:

1- Clone this repository

git clone https://github.com/MGuardia10/42pisicine_bsq.git

2- Navigate to the new directory and run make

cd 42piscine_bsq
make

3- Start the program by passing some maps to it, you can find a lot in maps directory:

./bsq <path_to_map> <path_to_map> <path_to_map> ...

If you want to try more maps, you can create new ones using gen_map.pl script.

perl gen_map.pl [LEN_LINES] [NBR_LINES] [DENSITY] > <new_file>

Compiling the Program

The bsq program comes with a Makefile that includes the following rules:

  • all: compiles the program.
  • re: recompiles the program.
  • clean: removes obj directory with objects files.
  • fclean: removes obj directory with objects files and bsq binary.

Disclaimer

At 42School, almost every project must be written in accordance to the Norm, the school's coding standard. As a result, the implementation of certain parts may appear strange and for sure had room for improvement.

About

My implementation of the 42madrid piscine final project.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published