hope this works

.gitignore

@@ -337,4 +337,8 @@ ASALocalRun/
 .localhistory/
 
 # BeatPulse healthcheck temp database
-healthchecksdb
+healthchecksdb
+
+# visual studio project
+*.pyproj
+*.sln

clean_code/algorithms/__init__.py

@@ -0,0 +1 @@
+

clean_code/algorithms/creation_algorithms.py

@@ -0,0 +1,70 @@
+from math import factorial
+
+"""This module supplies fast algorithms for pattern-related creations:
+   all permutations of a staring, duplicate-deletion."""
+
+def create_trimmed_string(base_string):
+    """deletes duplicates in a string. example: aaabbaac -> abac"""
+    trimmed_elements = []
+    trimmed_elements.append(base_string[:1])
+    for index in range(1, len(base_string)):
+        if base_string[index] != base_string[index-1]:
+            trimmed_elements.append(base_string[index])
+    return ''.join(trimmed_elements)
+
+
+def generate_permutations_iterably(elements):
+    """returns all the permutations of a string. the function is non-recursive"""
+    permutations = set()
+    final_set = set()
+    expectd_permutations_number = factorial(len(elements))
+
+    new_combinations = _first_cell_permutations(elements)
+    permutations.update(new_combinations)
+
+    while len(final_set) < expectd_permutations_number:
+        permutations_copy = permutations.copy()
+        permutations = set()
+
+        for permutation in permutations_copy:
+            new_combinations = _first_cell_permutations(permutation)
+            # the first permutation is the same as "permutation", so there
+            # is no need to add it again
+
+            permutations.update(new_combinations[1:])
+
+        final_set.update(permutations)
+
+    return final_set
+
+
+def _first_cell_permutations(base_state):
+    new_permutations = []
+    for index in range(len(base_state)):
+        splitted_base_state = list(base_state)
+        _switch_cells(splitted_base_state, 0, index)
+        new_permutations.append(''.join(splitted_base_state))
+
+    return new_permutations
+
+
+def _switch_cells(elements, first, second):
+    elements[first], elements[second] = elements[second], elements[first]
+
+
+def generate_permutations_recursively(base_string):
+    """returns all the permutations of a string. the function is recursive"""
+    return _generate_permutations_recursively(list(base_string))
+
+
+def _generate_permutations_recursively(elements):
+    permutations = []
+    if len(elements) == 1:
+        return elements
+
+    for permutation in _first_cell_permutations(elements):
+        for combination in _generate_permutations_recursively(permutation[1:]):
+            new_permutation = permutation[0] + combination
+            permutations.append(new_permutation)
+
+    return permutations

clean_code/algorithms/pattern_algorithms.py

@@ -0,0 +1,57 @@
+from bisect import insort
+
+
+"""This module supplies fast algorithms for pattern-related searches:
+   longest palindrome, biggest elements in a list."""
+
+def find_n_biggest_numbers(numbers, amount=20):
+    """return the nth biggest elements in the list"""
+    if len(numbers) <= amount:
+        return numbers
+    biggest_numbers = sorted(numbers[:amount])
+
+    for number in numbers:
+        if number > biggest_numbers[0]:
+            insort(biggest_numbers, number)
+            del biggest_numbers[0]
+
+    return biggest_numbers
+
+
+def find_longest_palindrome(base_string):
+    """returns the longest palindrome in a string"""
+    longest_length = 0
+    start_index = 0
+
+    for index in range(len(base_string) - 1):
+        for check_even in [True, False]:
+            current_length = _palindrome_length(base_string, index, check_even)
+            longest_length, start_index = max((longest_length, start_index), (current_length, index))
+
+
+    return _rebuild_palindrome(base_string, start_index, longest_length)
+
+
+def _palindrome_length(base_string, middle, check_even):
+    function_offset = 1 if check_even else 0
+
+    distance_from_middle = 1
+    right_end = distance_from_middle + middle + function_offset
+    left_end = middle - distance_from_middle
+
+    while right_end < len(base_string) and left_end >= 0 and base_string[right_end] == base_string[left_end]:
+        distance_from_middle += 1
+        right_end = distance_from_middle + middle + function_offset
+        left_end = middle - distance_from_middle
+
+    if not check_even:
+        return (distance_from_middle * 2) - 1
+    return (distance_from_middle * 2)
+
+
+def _rebuild_palindrome(base_string, start_index, length):
+    begining = start_index - int(length/2)
+    if length % 2 == 0:
+        begining += 1
+    end = start_index + int(length / 2) + 1
+    return base_string[begining:end]

clean_code/bfs_search.py

@@ -0,0 +1,65 @@
+from exceptions import BoardIntegrityError
+
+
+
+class BFS_search():
+    """Implements BFS algorithm to find the shortest path in the maze.
+        for more inforamtion visit:
+        https://en.wikipedia.org/wiki/Breadth-first_search."""
+
+    def __init__(self, graph):
+        self._graph = graph
+        self._finish_junction = self._graph.get_finish_junction()
+        self._start_junction = self._graph.get_start_junction()
+
+    def best_route_in_positions(self):
+        self._map_best_route()
+        best_route = self._create_best_route()
+        positions = self._graph.convert_junctions_to_positions(best_route)
+        return positions
+
+    def _map_best_route(self):
+        """adds all nodes connected to the current node to a queue.
+           repeats the process for every node in the queue 
+           until it reaches the desired node (end of maze)"""
+        sequence_number = 0
+        nodes = [self._start_junction]
+
+        self._start_junction.set_discovered(sequence_number)
+
+        while not len(nodes) == 0:
+            current_junction = nodes[0]
+            del nodes[0]
+
+            neighbours = current_junction.get_connections()
+            for neighbour in neighbours:
+                if neighbour.is_finish():
+                    neighbour.set_discovered(sequence_number)
+                    return
+
+                if not neighbour.is_discovered():
+                    nodes.append(neighbour)
+                    sequence_number += 1
+                    neighbour.set_discovered(sequence_number)
+
+
+        # if the algorithm checked all nodes without finding the finish node
+        # it means there is no solution
+        raise BoardIntegrityError("no solution!")
+
+    def _create_best_route(self):
+        best_route = []
+        current_junction = self._finish_junction
+
+        best_route.append(current_junction)
+
+        while not current_junction.is_start():
+            next_junction = self._get_smallest_sequence_number_neighbour(current_junction)
+            best_route.append(next_junction)
+            current_junction = next_junction
+
+        return best_route
+
+    def _get_smallest_sequence_number_neighbour(self, current_junction):
+        visited_junctions = filter(lambda connection: connection.is_discovered(), current_junction.get_connections())
+        return min(visited_junctions, key=lambda junction: junction.get_sequence_number())

clean_code/cell.py

@@ -0,0 +1,19 @@
+class Cell():
+    """Represents a square in the maze that can be a wall or a path."""
+    def __init__(self):
+        self._blocked = False
+        self._mark = None
+
+    def __str__(self):
+        if self._blocked:
+            return 'X'
+        return self._mark or ' '
+
+    def set_mark(self, _mark):
+        self._mark = _mark
+
+    def set_blocked(self):
+        self._blocked = True
+
+    def is_blocked(self):
+        return self._blocked

clean_code/exceptions.py

@@ -0,0 +1,3 @@
+
+class BoardIntegrityError(Exception):
+    """An  exception to indicate an illegal board"""

clean_code/graph.py

@@ -0,0 +1,78 @@
+from junction import Junction
+from position import Position
+
+
+class Graph():
+    """Stores the junction structure in graph form 
+       that a search algorithm can process."""
+    def __init__(self, start, finish, maze):
+        self._start = start
+        self._finish = finish
+        self._maze = maze
+        self._graph = []
+
+        self._create_graph()
+        self._update_junctions()
+
+        self._set_start()
+        self._set_finish()
+
+    def _create_graph(self):
+        for row in range(self._maze.get_rows()):
+            self._graph.append([])
+            for column in range(self._maze.get_columns()):
+                if self._maze.get_board()[row][column].is_blocked():
+                    self._graph[row].append(None)
+                else:
+                    current_junction = Junction(Position(row, column))
+                    self._graph[row].append(current_junction)
+
+    def _update_junctions(self):
+        junctions = filter(None, [node for row in self._graph for node in row])
+        for junction in junctions:
+            position = junction.get_position()
+
+            # by only connecting two at a time, no duplicate calls to
+            # get_junction_relative_to_position are made
+            upper_junction = self._get_junction_relative_to_position(position, -1, 0)
+            left_junction = self._get_junction_relative_to_position(position, 0, -1)
+
+            if upper_junction is not None:
+                junction.add_connection(upper_junction)
+                upper_junction.add_connection(junction)
+
+            if left_junction is not None:
+                junction.add_connection(left_junction)
+                left_junction.add_connection(junction)
+
+    def _get_junction_relative_to_position(self, position, row_offset=0, column_offset=0):
+        try:
+            return self._graph[position.get_row()+row_offset][position.get_column()+column_offset]
+        except IndexError:
+            return None
+
+
+    def __str__(self):
+        display = ""
+        for row in self._graph:
+            for node in row:
+                display += str(node) if node else ' '
+            display += '\n'
+        return display
+
+    def _set_start(self):
+        designated_start = self.get_start_junction()
+        designated_start.set_is_start()
+
+    def _set_finish(self):
+        designated_finish = self.get_finish_junction()
+        designated_finish.set_is_finish()
+
+    def get_finish_junction(self):
+        return self._get_junction_relative_to_position(self._finish)
+
+    def get_start_junction(self):
+        return self._get_junction_relative_to_position(self._start)
+
+    def convert_junctions_to_positions(self, junctions):
+        return [junction.get_position() for junction in junctions]

clean_code/junction.py

@@ -0,0 +1,57 @@
+from position import Position
+
+class Junction():
+    """Represents a path square in the maze.
+       connected to all the path-squares that are adjacent to it."""
+    def __init__(self, position):
+        self._connections = []
+        self._position = position
+        self._discovered = False
+        self._finish = False
+        self._start = False
+        self._sequence_number = None
+
+    def __str__(self):
+        if self._finish:
+            return ' f '
+        if self._start:
+            return ' s '
+        return ' ' + str(self._sequence_number) + ' '
+
+    def get_position(self):
+        return Position(self._position.get_row(), self._position.get_column())
+
+    def get_connections(self):
+        return self._connections
+
+    def get_sequence_number(self):
+        return self._sequence_number
+
+    def set_postion(self, position):
+        self._position.set_row(position.get_row())
+        self._position.set_column(position.get_column())
+
+    def set_discovered(self, sequence_number):
+        self._discovered = True
+        self._sequence_number = sequence_number
+
+    def set_is_finish(self):
+        self._finish = True
+
+    def set_is_start(self):
+        self._start = True
+
+    def has_connections(self):
+        return len(self._connections) > 0
+
+    def add_connection(self, connection):
+        self._connections.append(connection)
+
+    def is_start(self):
+        return self._start
+
+    def is_finish(self):
+        return self._finish
+
+    def is_discovered(self):
+        return self._discovered