To start programming in Java, you first need to install the software environment on your computer.
1) Download the Java installer.
You can download it from the official Oracle website using this link:
www.oracle.com/technetwork/java/javase/downloads/index.html
Download the latest version of the JDK. Choose the proper option for your operating system from the table. Remember that you should accept the license agreement to download the file. Continue reading
In this guide, I will show how to use the Fody tool to reduce the amount of the required program code, and the use of icon fonts and NcontrolView library for the manual drawing of interface elements.
Business Applications
The first thing you need to know is the definition of the business applications, and differences between them and other kinds of apps.
We usually divide applications into logical groups using such criteria:
– Interface complexity
– Usage of the OS features
– Frequency of the usage Continue reading
Hello! In this guide, I’ll show you the program to check the balance of different types of parentheses in an expression using C++.
Idea for Implementation
Everything would be much simpler if we had to check only one type of parentheses. If it is required to check the balance of the parentheses of only one type, for example, “(“ and “)”, we can read all the symbols one by one, ignoring all the symbols except the braces. If it is an opening bracket we increase the counter by 1, and if it’s a closing bracket we reduce the counter by one. After the check, it’s easy to define if the expression is balanced. If the counter is bigger than zero, we have more opening brackets. But if it goes lower than zero, we can’t check further. So we will use the stack. Continue reading
Hello! In this guide I’ll show you how to use BlueJ to create and run Java programs. My example will be with the Tic Tac Toe game.
Download and install BlueJ from the official website bluej.org:
Long ago, when monitors were black and green and computers had 64 kilobytes RAM, the legendary game was created. It was called “Snake” and it still has a lot of clones on different devices: from desktop to smartphones and tablets. But the original textual implementation hasn’t been used for years. So in this guide, I want to show you the canonical implementation of the legendary game.
Task:
Find the function of the Ackerman fuction A(m, n), using the recurrence relations:
Find the recursion depth. Continue reading
This article is intended to explain the essence of the fundamental methods of construction and optimization of artificial intelligence for computer games (mainly antagonistic). For example, “Minimax” algorithm and it’s “alpha-beta pruning” optimizations in the Rabbits&Wolves game.
Consecutive Numbers in Gray Code Sequence
Create a shader which fills the screen with blue color. For the space occupied by right half of screen, introduce a vertical green bar located in the middle of it, with its width being equal to one-third of it. This should result in right half of screen being divided into three equal parts (blue-green-blue). As for the left half of screen, introduce a pair of vertical red bars, with width of each being equal to one-fourth of it, resulting in left half of screen being divided into four equal parts (blue-red-blue-red). Continue reading
