Yahtzee is a game based on luck. Yet there are Algorithms designed to give an optimal result and succeeds in doing so. This report compares the end result of an optimal Algorithm to an Algorithm that has been modified for the multiplayer scenario. The modified Algorithm tries to win over the optimal Algorithm through taking greater risks in its decisions when falling behind in points. The results show that it is not favorable to do so.

Sudoku is a popular game of logic in the form of a puzzle. Sudoku puzzles are printed daily in Swedish newspapers. The challenge of solving these puzzles have inspired many programmers to develop Sudokusolving Algorithms. These Algorithms use different approaches in order to quickly and efficiently solve the puzzles. One such approach is the use of logical strategies initially developed for human players.

IDCT (Inverse Discrete Cosine Transform) is a common Algorithm being used with image and sound decompression. The Algorithm is a Fourier related transform which can occur in many different types like, one-dimensional, two-dimensional, three-dimensional and many more.The goal with this thesis is to create a fast and low effect version of two-dimensional IDCT Algorithm, where techniques as multiple-constant multiplication and subexpression sharing plus bit-serial and bit-parallel arithmetic are used.The result is a hardware implementation with power consumption at 19,56 mW..

The aim of this thesis project is to produce an Algorithm for finding a topologicalrepresentation of a polygon, called a straight skeleton, using floating pointarithmetic. Various straight skeleton Algorithms are examined and discussed witha focus on time complexity and one is chosen for implementation. This implementationis then compared with the open source library CGAL with regards torunning time. The result is an Algorithm which is based on an Algorithm by Felkeland Obdrzalek and which, for polygons with more than five thousand vertices andthree significant digits representing points, runs around 25% faster than CGALsimplementation. Complications regarding the use of floating-point arithmetic arealso discussed..

Randomness is a complex area of computer science, where only pseudo random numbers are possible to generate Algorithmically.This report presents established Algorithms for random number generation by conducting a basic study of relevant literature, while testing distribution and speed of the Algorithms contained within the C++11 Random library. The results are compared to the Algorithm XORShift and a modified version of it. The study shows that the modified Algorithm passes all tests in Small Crush, andthat the run time is shorter than for those in the Random library. The conclusion is that it is possible to, with simple means, modify an Algorithm to outperform the Algorithms of the C++11 Random library..

In our modern society, time is important. Technology is used in countless ways to faster get us from one point to another. The purpose of this report is to inquire whether there is a way to implement an option for personnel at Swedish hospitals to claim priority on an elevator call, and to do this in an efficient way. An ordinary elevator system has been simulated with an implementation of textit{Nearest Car Algorithm}, an Algorithm which calculates the most suitable elevator car to serve a specific call considering the distance between the call floor and the car and the direction. Along with this Algorithm, different ways to handle priority calls has been implemented to see how they affect the mean transport time for both passengers with priority and regular passengers in the elevator.

This thesis processes the work of developing CPU code and GPU code for Thomas Kaijsers Algorithm for calculating the kantorovich distance and the performance between the two is compared. Initially there is a rundown of the Algorithm which calculates the kantorovich distance between two images. Thereafter we go through the CPU implementation followed by GPGPU written in CUDA. Then the results are presented. Lastly, an analysis about the results and a discussion with possible improvements is presented for possible future applications..

This thesis processes the work of developing CPU code and GPU code for Thomas Kaijsers Algorithm for calculating the kantorovich distance and the performance between the two is compared. Initially there is a rundown of the Algorithm which calculates the kantorovich distance between two images. Thereafter we go through the CPU implementation followed by GPGPU written in CUDA. Then the results are presented. Lastly, an analysis about the results and a discussion with possible improvements is presented for possible future applications..

This thesis processes the work of developing CPU code and GPU code for Thomas Kaijsers Algorithm for calculating the kantorovich distance and the performance between the two is compared. Initially there is a rundown of the Algorithm which calculates the kantorovich distance between two images. Thereafter we go through the CPU implementation followed by GPGPU written in CUDA. Then the results are presented. Lastly, an analysis about the results and a discussion with possible improvements is presented for possible future applications..

This thesis processes the work of developing CPU code and GPU code for Thomas Kaijsers Algorithm for calculating the kantorovich distance and the performance between the two is compared. Initially there is a rundown of the Algorithm which calculates the kantorovich distance between two images. Thereafter we go through the CPU implementation followed by GPGPU written in CUDA. Then the results are presented. Lastly, an analysis about the results and a discussion with possible improvements is presented for possible future applications..

This thesis processes the work of developing CPU code and GPU code for Thomas Kaijsers Algorithm for calculating the kantorovich distance and the performance between the two is compared. Initially there is a rundown of the Algorithm which calculates the kantorovich distance between two images. Thereafter we go through the CPU implementation followed by GPGPU written in CUDA. Then the results are presented. Lastly, an analysis about the results and a discussion with possible improvements is presented for possible future applications..

This thesis processes the work of developing CPU code and GPU code for Thomas Kaijsers Algorithm for calculating the kantorovich distance and the performance between the two is compared. Initially there is a rundown of the Algorithm which calculates the kantorovich distance between two images. Thereafter we go through the CPU implementation followed by GPGPU written in CUDA. Then the results are presented. Lastly, an analysis about the results and a discussion with possible improvements is presented for possible future applications..

This report describes the procedure in which we accomplished our task, which was to implement a present Algorithm. This was made using C++. The Algorithm is developed by Sasan Gooran, who is our examiner in this project. The Algorithm uses an iterative method to produce the halftoned images. The reason for this project is to speed up the existing program which is made in Matlab.

Denna studie undersöker om det är möjligt att införa nåbarhetstestning i en baneditor. Testets syfte är att ersätta manuell testing, det vill säga att bankonstruktören inte ska behöva spela igenom banan för att säkerställa att denne kommer kunna nå alla nåbara positioner.För att kunna utföra studien skapas en enkel baneditor som testplattform. Vidare utförs en jämförande studie av flera alternativa algoritmer för att fastställa vilken som är mest passande för nåbarhetstestning i en baneditor.Resultatet från den jämförande studien visade att A* (A star) var den mest passande algoritmen för funktionen. Huruvida automatisk testning kan ersätta manuell testning är diskutabelt, men resultatet pekar på en ökad effektivitet i tid när det kommer till banbygge..

Abstract CORDIC (Coordinate Rotation Digital Computer) is an iterative Algorithm for the calculation of a two-dimensional vector in circular, linear or hyperbolic coordinate systems. This paper presents a survey of known CORDIC Algorithms and architectures for the rotation and vectoring mode in the circular cordinate system. In addition an implementation of the differential CORDIC Algorithm in VHDL has been done. The implementation is designed to keep the fast timing and throughput characteristic known for on-line redundant arithmetic..