How to create a puzzle game like Sokoban or Mummy Maze

I'm a beginner game developers, I'm really like puzzle game like Sokoban, Mummy Maze or Chip's Challenge. If i want to create a game like that (a simple game but player have to think to solve it) where should i start, what should i read to get ideas or game algorithm, ... anything can help me build a game like that.

Here's some picture about these games

https://i.sstatic.net/0XHdf.png

http://tientrieu.net/wp-content/uploads/2011/10/MmMaze5.jpg

Please help me, thanks for your time. Sorry for my bad english

Solution

I'd suggest using PuzzleScript to start a project like this. It's a simple environment for building tile-based games that have very little object state. Even if you end up using something else in the end, it's good for prototyping rules and levels.

Java DepthFirstSearch Algorithm not working
Problems with recursive functions
Python Maze Generation using PIL going wrong
List.append() changing all elements to the appended item
Implementing a randomly generated maze using Prim's Algorithm
How would I approach representing a "Thin-Walled" maze?
Problem with assigning value to reallocated dynamic array - maze solver
How to count cul-de-sacs (aka dead-ends) in a maze using Python?
Maze solving with breadth first search
Solving Maze using Backtracking C++
DFS Maze generation
solving a Maze Using Python
Swing - UI changes are not affected
Trying to create a program that solves mazes, but it is getting stuck in specific paths
How do I find 4 complementary 24bit RGB colors with no overlapping bits?
Determining rotation between two points in 2D array
Maze problem with obstacles - How to modify one instruction in given path to reach goal?
Represent Maze in Python
Algorithm for maze/labyrinth generation with no dead ends?
Min cost in maze traversal using recursion (please find the issue in below mention solution)
What is causing missing characters and incorrect starting location when creating a maze from a text file?
How to convert a maze to a Graph?
Why is the output always the same when I try to solve a maze using DFS
My implementation of Eller algorithm for maze generation doesn't generate random enough mazes. Am I doing something wrong?
Infinite maze generating algorithm
what does "IndexError: index 20 is out of bounds for axis 1 with size 20"
How do i save the path that has no dead ends in a maze solver (right-hand rule) (python)?
How do I change my code so it stops catching valid inputs?
Solving 2D maze, how to avoid runtime error for hidden test case?
Which Procedure we can use for Maze exploration BFS or DFS