Grid Printing Code for Python

 Github link : Click here

Note: The code is open-source but it highly advised to acknowledge this Web page or the github link whenever using this code in your project.


The main aim of this is to allow for easy access to a 2d grid with x,y coordinates. It can be used to create a chess board, Maze or just anything you could think of with a grid. 

The basic output look as follows:



The variables defined are:





The function in it are:



 For customization :

  • Change the variable x,y to alter the board size 
  • Insert values in the _coords lists to get a particular pattern in a certain cell
  • If you want to change the default cell filling then simply go to the end of print_board() function and under the heading default change the empty_cell function to any desired functions.


I hope this code will help you sometime in future or it gave you an idea to make a better version of it (then don't forgot to share it to me via commenting it down).

 Github link of the whole code: Click here

For any queries or suggestions comment below.


Comments

Post a Comment

For any queries or suggestions
Comment Here

Popular posts from this blog

Insertion Sort in python

Image
 In Insertion Sort , we sort the element in a list by taking 1 element at at a time and placing it in a position of sorted order. For eg , let a list be [45,23,56,8,34] In step 1 the first two elements will be compared and arranged accordingly . Then in step 2 the third element will be compared with the first two elements and inserted to create an order (ascending or descending) among the three elements and this process will be continued until all the elements have been arranged. CODE: l1=list() n=int(input("Enter the number of elements in list: ")) for e in range(n):     ele=int(input("Enter value for element: "))     l1.append(ele) print("Original list :",l1) for i in range (1,n): #in the outer loop it will traverse through each index from 1 till the last     for j in range(0,i): # in 2nd loop each element will be compared with every element before it         if l1[i]<l1[j]:             l1[i],l1[j]...
Read more

Binary search in python

Image
 l1=list() n=int(input("Enter the no. of elements: ")) for e in range(n):     ele=int(input("Enter value for element: "))     l1.append(ele) s=int(input("Enter number to be found: ")) l1.sort() #defining lowest and highest index l=0 h=n-1 while l<=h:     m=(l+h)//2     if l1[m]==s:         print(f"Found at index :{m} ")         break     elif l1[m]>s:         h=m-1     else:         l=m+1 else:     print("Not Found") PYTHON FILE LINK
Read more

Dictionary and Sets in Python

 Dictionary d={     "key1":"value1"     "key2":"value2" } d[key1] # output = value1  # will show error if key is incorrect Keys need to be of immutable data types eg, string,tuple or int  every key is unique,d is unordered [so no indexing]**,mutable Dictionary methods: d.keys()==print value of all keys as list (class=dict_keys) (list) output as dict_keys([list of keys]) d.values()==print all the values(list) output as dict_values([list of values]) d.items()== create a list of multiple tuples each having 2 elements :1 key and 1 value. output as dict_items([list of tuples]) d.update(d2)==add new item(s) of d2 in original dictionary at the end. or d[new_key]=new_value d.update("old_key","new_value")==replaces old value with new value d.get("key",error_message/value)== shows the related value or none # no error[default error message=None] print(d.get(...)) d.pop("key") d.clear() d.fromkeys(<a list of keys...
Read more