Conquest: Divide and Conquer 0.11.2 (Default branch)


 
Thread Tools Search this Thread
Special Forums News, Links, Events and Announcements Software Releases - RSS News Conquest: Divide and Conquer 0.11.2 (Default branch)
# 1  
Old 01-28-2009
Conquest: Divide and Conquer 0.11.2 (Default branch)

ImageConquest is a simultaneous turn-based onlinemultiplayer strategy game placed in a dark anddistant future. Play the role of a futuristicCommander. Divide your armies and conquer theworld. Position satellites to reveal youropponents. Launch missiles to annihilate bigarmies, but watch out for incoming drop podsbehind your back. Standing in your path to victoryare other Commanders like yourself. Fight them offone by one and prove you are the greatest of thegreat. The game uses 2D graphics, a slickinterface, strategic depth, and fast-paced turns.Drag and drop your way to victory.License: FreewareChanges:
This release enhances aesthetics and adds a simple statistics panel to the end of each match.Image

Image

More...
Login or Register to Ask a Question

Previous Thread | Next Thread
Login or Register to Ask a Question
dlasdt.f(3)							      LAPACK							       dlasdt.f(3)

NAME
dlasdt.f - SYNOPSIS
Functions/Subroutines subroutine dlasdt (N, LVL, ND, INODE, NDIML, NDIMR, MSUB) DLASDT creates a tree of subproblems for bidiagonal divide and conquer. Used by sbdsdc. Function/Subroutine Documentation subroutine dlasdt (integerN, integerLVL, integerND, integer, dimension( * )INODE, integer, dimension( * )NDIML, integer, dimension( * )NDIMR, integerMSUB) DLASDT creates a tree of subproblems for bidiagonal divide and conquer. Used by sbdsdc. Purpose: DLASDT creates a tree of subproblems for bidiagonal divide and conquer. Parameters: N N is INTEGER On entry, the number of diagonal elements of the bidiagonal matrix. LVL LVL is INTEGER On exit, the number of levels on the computation tree. ND ND is INTEGER On exit, the number of nodes on the tree. INODE INODE is INTEGER array, dimension ( N ) On exit, centers of subproblems. NDIML NDIML is INTEGER array, dimension ( N ) On exit, row dimensions of left children. NDIMR NDIMR is INTEGER array, dimension ( N ) On exit, row dimensions of right children. MSUB MSUB is INTEGER On entry, the maximum row dimension each subproblem at the bottom of the tree can be of. Author: Univ. of Tennessee Univ. of California Berkeley Univ. of Colorado Denver NAG Ltd. Date: September 2012 Contributors: Ming Gu and Huan Ren, Computer Science Division, University of California at Berkeley, USA Definition at line 106 of file dlasdt.f. Author Generated automatically by Doxygen for LAPACK from the source code. Version 3.4.2 Tue Sep 25 2012 dlasdt.f(3)