
# -*- coding: utf-8 -*-
'''
    File name: code\tours_on_a_4_x_n_playing_board\sol_237.py
    Author: Vaidic Joshi
    Date created: Oct 20, 2018
    Python Version: 3.x
'''

# Solution to Project Euler Problem #237 :: Tours on a 4 x n playing board
# 
# For more information see:
# https://projecteuler.net/problem=237

# Problem Statement 
'''
Let T(n) be the number of tours over a 4 × n playing board such that:
The tour starts in the top left corner.
The tour consists of moves that are up, down, left, or right one square.
The tour visits each square exactly once.
The tour ends in the bottom left corner.
The diagram shows one tour over a 4 × 10 board:




T(10) is 2329. What is T(1012) modulo 108?
'''

# Solution 

# Solution Approach 
'''
'''

d6274d62995f9140eae89d111942c8731885683d
<mask token>


# -*- coding: utf-8 -*-
'''
    File name: code\tours_on_a_4_x_n_playing_board\sol_237.py
    Author: Vaidic Joshi
    Date created: Oct 20, 2018
    Python Version: 3.x
'''

# Solution to Project Euler Problem #237 :: Tours on a 4 x n playing board
# 
# For more information see:
# https://projecteuler.net/problem=237

# Problem Statement 
'''
Let T(n) be the number of tours over a 4 × n playing board such that:
The tour starts in the top left corner.
The tour consists of moves that are up, down, left, or right one square.
The tour visits each square exactly once.
The tour ends in the bottom left corner.
The diagram shows one tour over a 4 × 10 board:




T(10) is 2329. What is T(1012) modulo 108?
'''

# Solution 

# Solution Approach 
'''
'''
