Skip to content

This project allows you to find the largest square in a map (the . represents the free spaces, the o the unusable spaces and the x the square).

Notifications You must be signed in to change notification settings

ZeHack0/Setting-Up

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

13 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Setting_up

The "setting_up" project is an program developed in C language. It is a first semester project of the elementary programming module in C at Epitech (B-CPE-110).

Table of Contents

Description

It is an Algorithm for finding the largest pssible square on map a while avoiding obstacle. you can solve a two type of map. In first a map read in file (.txt), and genreate your own map.

Prerequisites

Installation

Installation Steps

  1. Clone the repository :

    git clone https://github.com/ZeHack0/Setting-Up.git
    
  2. Navigate to the project directory :

    cd (name of directory project)
    
  3. Compile the project :

    make

This command uses the Makefile to compile the project. Ensure that the Makefile is correctly configured for your environment.

Usage

How tu use

  • From a file :

    ./space_hunter name_map.txt | cat -e
    
  • From a generate map :

    ./space_hunter [size_of_map] [pattern of the map] | cat -e
    

Example of Maps

  • This is an example of an maps:

    9
    ............................
    ....o.......................
    ............o...............
    ............................
    ....o.......................
    .............o..............
    ............................
    ......o...............o.....
    ..o.......o.................
    

Authors

About

This project allows you to find the largest square in a map (the . represents the free spaces, the o the unusable spaces and the x the square).

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published