Cyclic Maze Path Finder

You are given a 2D grid of characters representing a maze. Each cell in the grid can be one of the following:

• '.' representing an open space
• '#' representing a wall

From any open space, you can move to an adjacent open space in the four cardinal directions (up, down, left, right), but not diagonally.

Your task is to determine if there exists any cycle within the maze. A cycle is defined as a path that starts and ends at the same cell containing only open spaces, where the cycle length is at least 4, and during the cycle, you must not immediately reverse the direction you just moved in (i.e., you cannot go back to the cell you just came from if it would immediately close the cycle).

Write a function that takes as input the 2D grid (in a format of your choice) and returns a boolean value indicating whether such a cycle exists.

Consider edge cases such as an empty grid, grids with no open spaces, or grids where cycles are possible only in non-obvious configurations.