Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
2
20240414IEEETG
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
XingguoChen
20240414IEEETG
Commits
6111d3dd
Commit
6111d3dd
authored
May 27, 2024
by
Lenovo
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
先写2048游戏规则
parent
e811eb57
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
21 additions
and
5 deletions
+21
-5
main/2048isNonergodic.tex
+1
-0
main/background.tex
+17
-1
main/nonergodic.tex
+3
-4
No files found.
main/2048isNonergodic.tex
View file @
6111d3dd
...
@@ -8,6 +8,7 @@
...
@@ -8,6 +8,7 @@
\end{IEEEproof}
\end{IEEEproof}
%\input{material/2048prove}
...
...
main/background.tex
View file @
6111d3dd
\section
{
Background
}
\section
{
Background
}
\subsection
{
2048 game rules
}
The 2048 game consists of a 4
$
\times
$
4 grid board, totaling 16 squares.
At the beginning of the game, two squares are randomly filled
with tiles of either 2 or 4.
Players can make moves in four directions:
\textit
{
up
}
,
\textit
{
down
}
,
\textit
{
left
}
, and
\textit
{
right
}
.
When a player chooses a direction,
all tiles will move in that direction until
they hit the edge or another tile.
If two tiles with the same number are adjacent
in the moving direction, they will merge into
a tile with the sum of the original numbers.
Each tile can only participate in one merge operation per move.
After each move, a new tile appears on a random empty square.
The new tile is 2 with probability 0.1, and 4 with probability 0.9.
The game ends when all squares are filled, and no valid merge operations can be made.
\subsection
{
MDP
}
Consider Markov decision process (MDP)
Consider Markov decision process (MDP)
$
\langle
\mathcal
{
S
}$
,
$
\mathcal
{
A
}$
,
$
\mathcal
{
R
}$
,
$
\mathcal
{
T
}$$
\rangle
$
, where
$
\langle
\mathcal
{
S
}$
,
$
\mathcal
{
A
}$
,
$
\mathcal
{
R
}$
,
$
\mathcal
{
T
}$$
\rangle
$
, where
$
\mathcal
{
S
}
=
\{
1
,
2
,
3
,
\ldots\}
$
is a finite state space,
$
|
\mathcal
{
S
}
|
=
n
$
,
$
\mathcal
{
A
}$
is an action space,
$
\mathcal
{
S
}
=
\{
1
,
2
,
3
,
\ldots\}
$
is a finite state space,
$
|
\mathcal
{
S
}
|
=
n
$
,
$
\mathcal
{
A
}$
is an action space,
...
...
main/nonergodic.tex
View file @
6111d3dd
...
@@ -92,10 +92,9 @@ it is easy to provide a sufficient condition for non-ergodicity between non-abso
...
@@ -92,10 +92,9 @@ it is easy to provide a sufficient condition for non-ergodicity between non-abso
\begin{theorem}
[A sufficient condition for non-ergodicity between non-absorbing states]
\begin{theorem}
[A sufficient condition for non-ergodicity between non-absorbing states]
Given a Markov chain with absorbing states,
Given a Markov chain with absorbing states,
suppose the size of the non-absorbing states
$
|S
\setminus\{\text
{
T
}
\}
|
\geq
2
$
.
suppose the size of the non-absorbing states
$
|S
\setminus\{\text
{
T
}
\}
|
\geq
2
$
.
If the transition probabilities
$
Q
$
between non-absorbing states satifies,
If the transition matrix
$
Q
$
between non-absorbing states satifies,
$
\forall
i,j
\in
S
\setminus\{\text
{
T
}
\}
$
,
\begin{equation}
\begin{equation}
Q
_{
i,j
}
=
\begin{cases}
\forall
i,j
\in
S
\setminus\{\text
{
T
}
\}
,
Q
_{
i,j
}
=
\begin{cases}
\geq
0,
&
\text
{
if
}
i
\leq
j;
\\
\geq
0,
&
\text
{
if
}
i
\leq
j;
\\
0,
&
\text
{
otherwise.
}
0,
&
\text
{
otherwise.
}
\end{cases}
\end{cases}
...
@@ -104,7 +103,7 @@ Q_{i,j}=\begin{cases}
...
@@ -104,7 +103,7 @@ Q_{i,j}=\begin{cases}
Then, the Markov chain is non-ergodic between non-absorbing states.
Then, the Markov chain is non-ergodic between non-absorbing states.
\end{theorem}
\end{theorem}
\begin{IEEEproof}
\begin{IEEEproof}
Based on the assumption, the
$
Q
$
matrix
is an upper triangular matrix.
The
$
Q
$
matrix (
\ref
{
condition
}
)
is an upper triangular matrix.
The product of two upper triangular matrices is still an upper triangular matrix.
The product of two upper triangular matrices is still an upper triangular matrix.
Furthermore, the sum of two upper triangular matrices
Furthermore, the sum of two upper triangular matrices
is still an upper triangular matrix.
is still an upper triangular matrix.
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment