As the shape of the blackboard option line, the allocation procedure should

As the shape of the blackboard option line, the allocation procedure should : Coursework If you want to work in another language, please ask the instructor for permission. It is absolutely not allowed to use ++ language, and similar languages.
You can choose the term paper assignment from the options listed below, or propose it yourself. Self-created tasks require teacher approval. Several students can choose a variant of the assignment, but in this case the decision must be independent.
The code should not contain lines longer than 81 characters.

As an alternative to completing coursework, it is allowed to discuss a programming language (for example,, or other languages ​​agreed with the teacher) at the lecture (13 2nd, December 26th). A speech must be made for this story; you should be instructed in approximately 1 hour. If theft is detected, the task options will be changed. Write a program to find the arrangement of chess pieces that do not threaten each other on a rectangular chessboard. The input data is the size of the chessboard and, and the list of chess pieces that should be placed on the chessboard (the list may include knights, bishops, and rooks) and queens. The fragments in the list can be repeated). The output data should be displayed as a graphical list on the board with coordinates. No member of the board of directors may threaten other members of the board.

You will get a sequence of domino dice, where each dice is a pair of integers. According to the rules of the game, a chain with the maximum length is constructed from the given dice and output. According to the rules, the bones in the chain have the same value. The result should be displayed as an ordered list of bones.
The program should suggest the best or close movement for one of the sides based on some representation of the game position. Finding the best action should be done by listing options. See, for example, the article on English Wikipedia. This task can be modified: to achieve the mathematically best game algorithm.

Write programs to simplify algebraic expressions including arithmetic operations (addition, subtraction, Gross and multiplication), bracket notation, integer constants and lowercase Latin alphabet variables. Simplification should be done by expanding brackets and similar terms. The program accepts a string as input and outputs a string. Write a program to obtain derivatives of algebraic expressions, including arithmetic operations (addition, subtraction, and multiplication), bracket notation, integer constants, and lowercase Latin letters. Derivatives are calculated by applying the well-known rules of summation, difference and product. The program accepts the input string and variable name as derived variables. It also outputs a string in the output. This version and the previous version can be executed by a combination of two students-in order to simplify the expression first, then take the derivative from it, and then simplify it again. It may be possible to share some source code.
Write a program to generate a recursive top-down parser. The generated program can use any general programming language. This problem can be solved together, but in this case, it is necessary to clearly indicate who did what. Compilation should be done in stages, which is actually compilation. Tip: There are such facilities. Blackboard Learn Ultra: It’s never been easier to teach and learn