Correcting computer science text "PARTIAL BOARD TREE SEARCH"
3370
£40(approx. $50)
- Posted:
- Proposals: 2
- Remote
- #651471
- Archived
Description
Experience Level: Intermediate
Num. of words: 2840
Topic: Editing
Tone: Formal/Professional
Extensive research needed: no
Extra notes: I am looking for someone experienced in computer science/gaming etc who understands the following text and is able to improve/edit/correct the english. If you are interested please let me know. I really need someone who understands the text rather than a general proofreader.
I would need the corrections back by 5th January 15:00 UK time.
This is an example of the text below:
Commonly known game trees, called here classic consist of nodes presenting situations in the game connected
with edges corresponding with performed moves. The root of tree presents an initial situation in the game. Its
successors are the positions in the game available for all possible moves made by the player starting the game. In
each of them the second player has a choice of possible moves which lead to subsequent nodes and so on. At a
certain point the game ends. It is then called a leaf of game tree, in which you can clearly determine the outcome
of the game: win, lose, or draw.
A computer with infinite memory or processing power could solve any game if only it was complete. Searching
entire tree one can easily choose the best move in possible game situation. The simplest application of such
solving technique is minimax algorithm constructed on the base of mathematical model described in the 1950's
by Von Neumann and Morgenstern, 1953. Two players called Max and Min, from all accessible moves choose
those, which ensure the best possible outcomes. The first player Max aims at achieving the highest score. On the
contrary the goal of the second player is to minimize the game outcome of the Max player. Precise description of
the minimax algorithm can be found in many publication and so it will not be discussed here.
Topic: Editing
Tone: Formal/Professional
Extensive research needed: no
Extra notes: I am looking for someone experienced in computer science/gaming etc who understands the following text and is able to improve/edit/correct the english. If you are interested please let me know. I really need someone who understands the text rather than a general proofreader.
I would need the corrections back by 5th January 15:00 UK time.
This is an example of the text below:
Commonly known game trees, called here classic consist of nodes presenting situations in the game connected
with edges corresponding with performed moves. The root of tree presents an initial situation in the game. Its
successors are the positions in the game available for all possible moves made by the player starting the game. In
each of them the second player has a choice of possible moves which lead to subsequent nodes and so on. At a
certain point the game ends. It is then called a leaf of game tree, in which you can clearly determine the outcome
of the game: win, lose, or draw.
A computer with infinite memory or processing power could solve any game if only it was complete. Searching
entire tree one can easily choose the best move in possible game situation. The simplest application of such
solving technique is minimax algorithm constructed on the base of mathematical model described in the 1950's
by Von Neumann and Morgenstern, 1953. Two players called Max and Min, from all accessible moves choose
those, which ensure the best possible outcomes. The first player Max aims at achieving the highest score. On the
contrary the goal of the second player is to minimize the game outcome of the Max player. Precise description of
the minimax algorithm can be found in many publication and so it will not be discussed here.
MD O.
100% (114)Projects Completed
57
Freelancers worked with
42
Projects awarded
32%
Last project
18 Nov 2016
United Kingdom
New Proposal
Login to your account and send a proposal now to get this project.
Log inClarification Board Ask a Question
-
There are no clarification messages.
We collect cookies to enable the proper functioning and security of our website, and to enhance your experience. By clicking on 'Accept All Cookies', you consent to the use of these cookies. You can change your 'Cookies Settings' at any time. For more information, please read ourCookie Policy
Cookie Settings
Accept All Cookies