aboutsummaryrefslogtreecommitdiffstats
path: root/csci4511w/writing2.tex
diff options
context:
space:
mode:
Diffstat (limited to '')
-rw-r--r--csci4511w/writing2.tex17
1 files changed, 17 insertions, 0 deletions
diff --git a/csci4511w/writing2.tex b/csci4511w/writing2.tex
new file mode 100644
index 0000000..dd6e524
--- /dev/null
+++ b/csci4511w/writing2.tex
@@ -0,0 +1,17 @@
+\documentclass{article}
+\usepackage[utf8]{inputenc}
+\usepackage{parskip}
+
+\title{Writing 2}
+\author{Matt Strapp}
+\date{2021-02-26}
+\begin{document}
+ \maketitle
+ \section*{Theta*}
+ This paper is about a modification of the $A^{\ast}$ algorithm that is dubbed $\theta^{\ast}$.
+ The paper is proposing a new algorithm by building on a previous one and altering it for other conditions.
+ Theta$^{\ast}$ modifies A$^{\ast}$ by allowing A$^{\ast}$ where any vertex can be the parent of any other vertex, compated to A$^{\ast}$ where the only successors allowed are the direct parents of the node.
+ The differences can best be demonstrated when there are obstacles in the grid. This is demonstrated in the paper as obstacles in a video game.
+ In the paper, the authors validate the algorithm with experiments involving small grids, large grids, and maps from the CRPG Baludr's Gate II.
+
+\end{document} \ No newline at end of file